1
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”?
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?
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.
Questions Asked from Trees (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2023 (1)
GATE CSE 2022 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (2)
GATE CSE 2018 (1)
GATE CSE 2015 Set 1 (3)
GATE CSE 2015 Set 3 (2)
GATE CSE 2015 Set 2 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2011 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (2)
GATE CSE 2006 (2)
GATE CSE 2005 (1)
GATE CSE 2004 (2)
GATE CSE 2003 (1)
GATE CSE 2000 (1)
GATE CSE 1998 (1)
GATE CSE 1996 (2)
GATE CSE 1995 (1)
GATE CSE 1987 (2)
GATE CSE Subjects
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