1.

One can determine whether a Binary tree is a Binary Search Tree by traversing it in(A) Preorder(B) Inorder(C) Postorder(D) Any of the three orders  

Answer»

Correct option-(B) Inorder 



Discussion

No Comment Found

Related InterviewSolutions