Question

Consider the following statements :
A. In a binary search tree, left sub tree has smaller value than right sub tree

B. In doubly linked list, only forward traversal is possible

C. In C, a function may not always return a value

D. Two dim array requires two index variables

E. A tree must have at least two nodes

Choose the correct answer from the options given below :

• A. A, B, C only
• B. B, A, D only
• C. C, D, E only
• D. D, C, A only

Hint:

"Binary" in BST refers to the two-way split, but "Search" is enabled by the specific ordering: Left $<$ Root $<$ Right.

Answer 1

The Correct Option is D