Data Structures
Stacks and Queues
Marks 1Marks 2
Linked List
Marks 1Marks 2
1
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
A
A tree with a n nodes has (n – 1) edges
B
A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.
C
A complete binary tree with n internal nodes has (n + 1) leaves.
D
The maximum number of nodes in a binary tree of height h is ( 2h+1 - 1 ).
2
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
3
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
4
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
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization