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 :

Show Hint

"Binary" in BST refers to the two-way split, but "Search" is enabled by the specific ordering: Left $<$ Root $<$ Right.
Updated On: Jun 6, 2026
  • A, B, C only
  • B, A, D only
  • C, D, E only
  • D, C, A only
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

We analyze each statement regarding data structures and C programming. 1. Evaluating A, B, and C:
A: In a BST, for any node, values in the left subtree are smaller than the node, and values in the right subtree are larger. Thus, the left subtree naturally has smaller values than the right. Statement A is correct.
B: A doubly linked list has both next and prev pointers, allowing both forward and backward traversal. Statement B is incorrect.
C: Functions defined with a void return type do not return a value. Statement C is correct. 2. Evaluating D and E:
D: Accessing an element in a 2D array requires a row index and a column index (e.g., arr[i][j]). Statement D is correct.
E: A tree can have only one node (the root). A "null" or empty tree is also sometimes considered a tree. It does not require two nodes. Statement E is incorrect. Conclusion: Statements A, C, and D are correct.
Was this answer helpful?
0
0

Top CUET PG Data Science A.I Cyber Security and Computer Sci. Questions

View More Questions

Top CUET PG Programming and Data Structures Questions

View More Questions