To how to write pseudo code to insert a new node to binary search tree. using c++.

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; i believe the correct answer is (a) all trenches must have access/egress;

you are welcome for my answer it is b⇔⇒⊕