Answer:
Let the function be Node* ins(Node *root,int k)
if root node is NULL then return new node with data equal to k.
If the k <root->data
root->left=ins(root->left,k);
else if k >root->data
root->right =ins(root->right,k);
At last return root.
Explanation:
Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.
Answer:
length is your answer
Explanation:
Have a great day! ^-^
can you me as brainliest if its right? i need 10000 points and 35 brainliest's to rank up to genius
Answer:
ouch what happened to him
congrats you ruined my childhood
(thanks for the free points!!)
