Vidyalelo
Data Structure · Q43

Binary Search Trees(B Tree)

Programming · Data Structure · question 43

Q43

What is the result of an inorder traversal of a Binary Search Tree (BST)?

A.
Nodes are visited in ascending order.
Answer
B.
Nodes are visited in descending order.
C.
Nodes are visited in the order of their depth.
D.
Nodes are visited in the order they are inserted.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Binary Search Trees(B Tree) questions