✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
For this pseudocode:
function M(root,x) if (root==NULL) Node newNode= new Node(x) root=newNode else if(x < root->data) M(root->left,x+1) else M(root->right,x-1) end functionAssume that the tree starts empty. After executing the function M with the following numbers: 4, 7, 12, 1, 3. What node is stored in the parent of 3?