1
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sequences denotes the post order traversal sequence of the tree of previous question?
A
f e g c d b a
B
g c b d a f e
C
g c d b f e a
D
f e d g c b a
2
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
In the balanced binary tree in Fig. given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? GATE CSE 1996 Data Structures - Trees Question 83 English
A
1
B
3
C
7
D
8
3
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is:
A
log2n
B
n − 1
C
n
D
2n
4
GATE CSE 1987
True or False
+1
-0
If the no of leaves in a tree is not a power of 2,then the tree is not a binary tree.
A
TRUE
B
FALSE
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP