CPS 393 Lecture Notes - Lecture 9: Linked List, Gnu Debugger, While Loop

• School: Ryerson University
• Department: Computer Science
• Course: CPS 393
• Professor: Lester Hiraki

Document Summary

Searching through the linked list: eg: treename spruce\0 so it checks through at each node p is a variable inside the function checktree pass spruce\0 into the function. /* a function to check if a tree is in the list. #define nl 20 typedef struct tree { char tree_name [nl]; struct tree* next; }tree; int checktree (tree *p, char name[]){ // receive the address of the ll and array. // name is a pointer disguised as an array!!! // this is bc name contains an address int found = 0; while (p != null) > tree_name, name) == 0) // want to compare if spruce is equal to any of the trees found = 1; // if they match set found to 1 p = p -> next; return (found); int main(){ /* declaring variables to hold tree nodes */ tree tree1, tree2, tree3, tree4;