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?
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”?
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:
4
GATE CSE 1987
True or False
+1
-0
It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages