Test by Bikram | Data Structures | Test 2 | Question: 16

Question

For inorder traversal of a BST, which of the following statements is TRUE?

• A. O/p is always in sorted decreasing order.
• B. O/p always in sorted increasing order
• C. It does not sort the number at all.
• D. O/p always in reverse sorted decreasing order.

Comments

but sir if we have all the keys to be inserted in the binary tree are all equal then we will get non decreasing order.

crct me if i am wrong?

---

Yes You are right.

Answer 1

 In-order Traversal of Binary Search Tree is always sorted in Ascending Order.

So, the answer is $(B)$.