Use app×
Ask a Question
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE

One can determine whether a Binary tree is a Binary Search Tree by traversing it in

← Prev Question Next Question →
+2 votes
30.1k views
in Computer by (69.2k points)
closed by

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  

Play Quiz Game >

2 Answers

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

Correct option is (B) Inorder

  • In the case of binary search trees (BST), Inorder traversal gives nodes in non-decreasing order.
  • To get nodes of BST in non-increasing order, a variation of Inorder traversal where Inorder traversal s reversed can be used.
+2 votes
by (70.0k points)

Correct option-(B) Inorder 

← Prev Question Next Question →

Find MCQs & Mock Test

  1. JEE Main 2025 Test Series
  2. NEET Test Series
  3. Class 12 Chapterwise MCQ Test
  4. Class 11 Chapterwise Practice Test
  5. Class 10 Chapterwise MCQ Test
  6. Class 9 Chapterwise MCQ Test
  7. Class 8 Chapterwise MCQ Test
  8. Class 7 Chapterwise MCQ Test

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.

Categories

User Contribution to Sarthaks eConnect
Managed by Sarthaks Digitizing India
...