1
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+1
-0.33

Consider the following $B^{+}$tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the $B^{+}$tree. Which of the following options(s) is/are CORRECT?

GATE CSE 2025 Set 1 Data Structures - Trees Question 6 English

A
None of the nodes will split.
B
At least one node will split and redistribute.
C
The total number of nodes will remain same.
D
The height of the tree will increase.
2
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+1
-0

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having $n$ distinct integers?

A
The maximum length of a path from the root node to any other node is $(n-1)$.
B
An inorder traversal will always produce a sorted sequence of elements.
C
Finding an element takes $\mathrm{O}\left(\log _2 n\right)$ time in the worst case.
D
Every BST is also a Min-Heap.
3
GATE CSE 2025 Set 1
Numerical
+1
-0

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.

Suppose a Min-Heap $T$ stores 32 keys. The height of $T$ is ________ (Answer in integer)

Your input ____
4
GATE CSE 2023
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following sequences when stored in an array at locations $$A[1],....,A[10]$$ forms a max-heap?

A
$$23,17,10,6,13,14,1,5,7,12$$
B
$$23,17,14,7,13,10,1,5,6,12$$
C
$$23,17,14,6,13,10,1,5,7,15$$
D
$$23,14,17,1,10,13,16,12,7,5$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP