1
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
2
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?
I. 3, 5, 7, 8, 15, 19, 25
II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20
IV. 4, 6, 7, 9 18, 20, 25
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following rooted tree with the vertex labelled P as the root
The order in which the nodes are visited during an in-order traversal of the tree is

Questions Asked from Trees (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2025 Set 2 (2)
GATE CSE 2025 Set 1 (3)
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 3 (2)
GATE CSE 2015 Set 2 (2)
GATE CSE 2015 Set 1 (3)
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