✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
For this pseudocode:
function W(root,x) if (root==NULL) Node newNode= new Node(x) root=newNode else if(x > root->data) W(root->left,x) else W(root->right,x) end functionAssume that the tree starts empty. After executing the function W with the following numbers: 9, 18, 6, 3, 7. What is the left child of 6?