StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POBinary tree implementation in C question as found in K&R
text
Body
copied!<p>So I've been reading through the K&R C book and have a question.. in the 6th Chapter on structs on page 140-141, there is code that looks like this (I took out some of the more irrelevant parts)</p> <pre><code>/* the program loops through a tree looking for some word if it finds the word itll incremenet the count by 1 if it doesnt itll add a new node */ struct node { char *word; int count; struct node *left; struct node *right; } main() { struct node *root; char word[1000]; root = NULL; while(getword(word, MAXWORD) != EOF) /* getword just grabs 1 word at a time from a file of words */ if(isalpha(word[0])) /* isalpha checks to see if it is a valid word */ root = addNode(root, word); treeprint(root); /* prints the tree */ return 0; } struct node *addNode(struct node *p, char *w) { int cond; if(p == NULL) { p = malloc(sizeof(struct node)); /* allocates memory for the new node */ p -> word = strdup(w); p -> count = 1; p -> left = p -> right = NULL; } else if ((cond = strcmp(w, p -> word)) == 0) p -> count++; else if(cond < 0) p -> left = addNode(p -> left, w); else p -> right = addNode(p -> right, w); return p; } </code></pre> <p>And my confusion is in the main() function at root = addNode(root, word)</p> <p>If addNode returns a pointer to the newly added node (or to the node that word is at if its already int he tree), wouldn't that "lose" all the data above the tree? Shouldn't root stay as the root of the tree?</p> <p>Thanks!</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload