Multiple choice technology architecture

The in order traversal of tree will yield a sorted listing of elements of tree in

  1. Binary trees

  2. Binary search trees

  3. Heaps

  4. None of above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

In-order traversal of a binary search tree visits nodes in ascending order of their keys because of the BST property: left child < parent < right child. This is a fundamental property of BSTs. Option A is incorrect because regular binary trees have no ordering property. Option C is incorrect because heaps have different ordering properties.

Keep practicing — related questions