binary tree recursion c

Hi all!
How to walked around binary tree use double recursion onto c non c++?
I'm to search optimal algorithm fining. Example, I've been any a first symbol the word and I'll take any entries onto this queri.
Binary Tree Recursion

void traverse_btree(struct treenode *pNode)
{
if (!pNode)
return;

traverse_btree(pNode->pLeft);

// Add code ehre to Handle Node processing

traverse_btree(pNode->pRight);
}

Additional info
http://en.wikipedia.org/wiki/Binary_search_tree
Topic archived. No new replies allowed.