Vidyalelo
Data Structure · Q27

Binary Search Trees(B Tree)

Programming · Data Structure · question 27

Q27

In a Binary Search Tree (BST), what happens when you perform an inorder traversal?

A.
Nodes are visited in ascending order.
Answer
B.
Nodes are visited in descending order.
C.
Nodes are visited in a random order.
D.
Nodes are visited in the order they were inserted.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board