123456789101112131415161718192021222324252627
void BinarySearchTree::findElement(struct tree_node* node, int d) { if (node==NULL) { cout<<"Element not found!\n"; } else { if (d == node->data) { cout<<"Element found\n"; } //findElement(d,p->left); else { if(d < node->data) { cout<<"Element Found !"; // return(findElement(node->left,d)); } else return(findElement(node->right, d)); cout<<"Element Found !"; } } }
b.findElement(node,z);
void findElement(struct tree_node* node,int);