1
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
The numbers 1, 2, ........, n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be
A
p
B
p + 1
C
n – p
D
n – p + 1
2
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
A
2
B
3
C
4
D
6
3
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Level order traversal of a rooted tree can be done by starting from the root and performing
A
preorder traversal
B
in-order traversal
C
depth first search
D
breadth first search
4
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?
A
7 5 1 0 3 2 4 6 8 9
B
0 2 4 3 1 6 5 9 8 7
C
0 1 2 3 4 5 6 7 8 9
D
9 8 6 4 2 3 0 1 5 7
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