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 :
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. 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: Aug 6, 2026
- A, B, C only
- B, A, D only
- C, D, E only
- D, C, A only
Show Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
Concept:
• Binary Search Trees (BST) maintain a specific ordering to facilitate efficient searching.
• Different data structures (Lists, Arrays, Trees) have unique properties regarding traversal and connectivity.
• Programming languages like C have specific rules for function definitions.
Step 1: Analyze BST properties (A)
In a BST, for any node \(N\), all values in the left subtree are smaller than \(N\), and all values in the right subtree are larger than \(N\). Consequently, the left subtree values are always smaller than the right subtree values. Statement A is correct.
Step 2: Analyze Doubly Linked Lists (B)
A doubly linked list contains two pointers per node: next and prev. This allows for bidirectional traversal (both forward and backward). Statement B is incorrect.
Step 3: Analyze C function returns (C)
In C, a function declared with the void return type does not return a value. For example, void display() { ... }. Therefore, it is true that a function may not always return a value. Statement C is correct.
Step 4: Analyze 2D Array indexing (D)
To access a specific element in a two-dimensional array, one must specify both the row index and the column index (e.g., arr[i][j]). Thus, two index variables are required. Statement D is correct.
Step 5: Analyze the definition of a Tree (E)
A tree can be empty (a NULL tree) or consist of only a single node (the root). It does not strictly require two nodes. Statement E is incorrect.
• Binary Search Trees (BST) maintain a specific ordering to facilitate efficient searching.
• Different data structures (Lists, Arrays, Trees) have unique properties regarding traversal and connectivity.
• Programming languages like C have specific rules for function definitions.
Step 1: Analyze BST properties (A)
In a BST, for any node \(N\), all values in the left subtree are smaller than \(N\), and all values in the right subtree are larger than \(N\). Consequently, the left subtree values are always smaller than the right subtree values. Statement A is correct.
Step 2: Analyze Doubly Linked Lists (B)
A doubly linked list contains two pointers per node: next and prev. This allows for bidirectional traversal (both forward and backward). Statement B is incorrect.
Step 3: Analyze C function returns (C)
In C, a function declared with the void return type does not return a value. For example, void display() { ... }. Therefore, it is true that a function may not always return a value. Statement C is correct.
Step 4: Analyze 2D Array indexing (D)
To access a specific element in a two-dimensional array, one must specify both the row index and the column index (e.g., arr[i][j]). Thus, two index variables are required. Statement D is correct.
Step 5: Analyze the definition of a Tree (E)
A tree can be empty (a NULL tree) or consist of only a single node (the root). It does not strictly require two nodes. Statement E is incorrect.
Was this answer helpful?
0
0
Top CUET PG Data Science A.I Cyber Security and Computer Sci. Questions
- Choose the correct answer from the options given below:
(A). RAID 3 requires only a single redundant disk.
(B) In RAID 4 scheme, two different parity calculations are carried out and stored in separate blocks on different disks.
(C) RAID 5 distributes the parity strips across all disks.
(D) In RAID 2, the number of redundant disks are proportional to the log of the number of data disks. - In case of DMA, after the completion of the transfer, the processor is required to be notified of the completion. This is done through.
- In a two-level memory hierarchy, the access time of the cache memory is 12 nsec and the access time of the main memory is 1.5 msec. The hit ratio is 0.98. What is the average access time of the two-level memory system?
- Match List I with List II.
List I List II A. Supervisor mode I. Entered when the processor encounters a software interrupt instruction B. Abort Mode II. Entered in response to memory fault C. Fast Interrupt Mode III. Entered whenever the processor receives an interrupt signal from a designated fast interrupt source D. Interrupt Mode IV. Entered whenever the processor receives an interrupt signal from any other source - Deallocation of stack of thread and register contexts will take place.
View More Questions
Top CUET PG Programming and Data Structures Questions
- A hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?
- The worst-case time complexity of inserting a node in a doubly linked list is:
- Consider the given two statements:
S1: Kruskal’s Algorithm might produce a non-minimal spanning tree.
S2: Kruskal’s Algorithm can be efficiently implemented using the disjoint set data structure.
Choose the correct answer from the options given below: - Match List I with List IIChoose the correct answer from the options given below:
LIST I LIST II (A) Circular Linked List (I) Recursive Function Calls (B) Doubly Linked List (II) Round Robin Queue in CPU (C) Stack (III) Hash Tables (D) Singly Linked List (IV) Undo and Redo Functionality - Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(A) 2
(B) 3
(C) 1
(D) 4
(E) 5
Choose the correct answer from the options given below:
View More Questions
Top CUET PG Questions
- Given below are two statements:
Statement I: For Plato the meaning of the word 'Justice' is basically a conception in the mind only.
Statement II: For Plato the meaning of the word 'Justice' is fixed, mind-independently
In the light of the above statements, choose the correct answer from the options given below: - What is the electron count of OS6CO182-?
- XeF4 hydrolysis gives A + B, HF, and Oxygen. Find A and B
- What is more basic in pyrol and pyridine?
- Hydrolysis of Al2C3, Be2?
View More Questions