Wednesday, January 26
Hello,
I am trying to traverse a binary tree, returning each node that is
encounterd so that I can preform operations on that node. However it keeps
looping over the same first node, it refuses to travel any further down
the tree ... What did I overlooked ? I know the tree is loaded with data
since a simple recursive preorder treeprint confirms that.
An example:
while((root = treerecurse(root)) != NULL)
printf("%4d %s\n", root->count, root->word);
And the treerecurse function would look something like:
struct tnode *treerecurse(struct tnode *p) {
if(p != NULL) {
treerecurse(p->left);
return p;
treerecurse(p->right);
}
}
I guess there is something wrong in my reasoning about this...
Thnkx..
J.
-
To unsubscribe from this list: send the line "unsubscribe linux-c-programming"
in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
