1
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 55. Which of the following sequences CANNOT be the sequence of nodes examined?
A
{10, 75, 64, 43, 60, 57, 55}
B
{90, 12, 68, 34, 62, 45, 55}
C
{9, 85, 47, 68, 43, 57, 55}
D
{79, 14, 72, 56, 16, 53, 55}
2
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is
A
nk
B
(n – 1)k + 1
C
n(k – 1) + 1
D
n(k – 1)
3
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:
A
2h – 1
B
2h – 1 + 1
C
2h – 1
D
2h
4
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
How many distinct binary search trees can be created out of 4 distinct keys?
A
5
B
14
C
24
D
42
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP