Which of the following binary tree traversals arranges the node values in…
2019
Which of the following binary tree traversals arranges the node values in ascending order when it is applied over a binary search tree?
Answer: B. Inorder traversal — In a Binary Search Tree (BST), inorder traversal visits nodes in ascending (sorted) order.
- A.
Level-order traversal
- B.
Inorder traversal
- C.
Preorder traversal
- D.
Postorder traversal
Attempted by 1667 students.
Show answer & explanation
Correct answer: B
In a Binary Search Tree (BST), inorder traversal visits nodes in ascending (sorted) order.
Loading lesson…