Question: 33
(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.
A. Node search(int x)
{ Node p = root;
while(p.info != x && p!=null)
{if(x<p.info) pp.left;
}
else p=p.right;
return(p);
B. Node search(int x)
{ Node p = root;
}
while(p.info != x)
{if(x<p.info) p p.left;
else p=p.right;
return(p);
C. Node search(int x)
{ Node p = root;
while(p!=null && p.info != x)
{if(x<p.info) p=p.left;
else p=p.right;
}
return(p);
}
