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.
The correct answer for the question that is being presented above is this one: "5.5" <span>Keeping in mind the role the order of precedence plays in equations, Excel would display as the result of the following equation? =(24+75)/(6*3): 5.5.</span>
