1
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.67

Consider a binary tree $T$ in which every node has either zero or two children. Let $n>0$ be the number of nodes in $T$. Which ONE of the following is the number of nodes in $T$ that have exactly two children?

A
$\frac{n-2}{2}$
B
$\frac{n-1}{2}$
C
$\frac{n}{2}$
D
$\frac{n+1}{2}$
2
GATE CSE 2025 Set 2
Numerical
+1
-0

Suppose the values $10,-4,15,30,20,5,60,19$ are inserted in that order into an initially empty binary search tree. Let $T$ be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of $T$ is ________ (Answer in integer)

Your input ____
3
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 5 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.
4
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.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12