1
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i] and the right child, if any, in X[2i+1]. To be able to store any binary tree on n vertices the minimum size of X should be
A
log2 n
B
n
C
2n + 1
D
2n-1
2
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
3
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
4
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
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP