(Choose 1 answer)
Suppose we are considering a binary search tree.Select the most correct java code snippet that search a node with value x on the sub-tree with root p.
A.Node search(Node p, int x){if(p.info==x) return(p);
if(x<p.info)return(search(p.left,x));elsereturn(search(p.right,x));}
B. Node search(Node p, int x){ if(p==null) return(null);if(p.info==x) return(p);if(x<p.info)return(search(p.left,x));elsereturn(search(p.right,x));}
C. Node search(Node p, int x){ if(p==null) return(null);if(p.info==x) return(p);if(x<p.info)return(search(p.right,x));elsereturn(search(p.left,x));
}
Exit 46
