In binary seach tree each node has a value and two referenced subnodes one we call left childnode and another is right child node.
struct node {
int data;
node* left_node;
node* right_node;
}
In binary seach tree each node has a value and two referenced subnodes one we call left childnode and another is right child node.
struct node {
int data;
node* left_node;
node* right_node;
}