Sarthaks Test
0 votes
in Computer by (69.0k points)

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  

1 Answer

+1 vote
by (69.6k points)
selected by
Best answer

Correct option-(B) Inorder 

Related questions

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.