Multiple choice

Inorder traversal of Binary Search Tree gives which of the following?

  1. Descending order of inserted elements

  2. Random order of inserted elements

  3. Ascending order of inserted elements

  4. The order in which the elements are inserted

  5. None of the above
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

yes in order traversal of binary search tree gives ascending order of inserted elements. the in order pattern is as followsleft->root->right. So when we traverse it goes to the last element in the left sub tree and display it and then its root and its right sibling. this pattern is applied recursively.

Keep practicing — related questions