In the binary tree tutorial, i am having a little trouble understanding one part of the code.
node *btree::search(int key, node *leaf)
{
if(leaf!=NULL)
{
if(key==leaf->key_value)
...
Type: Posts; User: drdrake
In the binary tree tutorial, i am having a little trouble understanding one part of the code.
node *btree::search(int key, node *leaf)
{
if(leaf!=NULL)
{
if(key==leaf->key_value)
...