1
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24
The number of nodes in the left subtree and right subtree of the root respectively is
2
GATE CSE 1996
MCQ (More than One Correct Answer)
+2
-0.6
A binary search tree is used to locate the number 43. Which of the following
probe sequences are not possible?
3
GATE CSE 1991
Fill in the Blanks
+2
-0
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
![GATE CSE 1991 Data Structures - Trees Question 62 English](https://gateclass.cdn.examgoal.net/TRdoicUd571lfLtE1/GySYo13acehdsQsdKhFCos0lEJJeF/b92cHAjZtCyzI0HSbwbUwZ/uploadfile.jpg)
![GATE CSE 1991 Data Structures - Trees Question 62 English](https://gateclass.cdn.examgoal.net/TRdoicUd571lfLtE1/GySYo13acehdsQsdKhFCos0lEJJeF/b92cHAjZtCyzI0HSbwbUwZ/uploadfile.jpg)
Questions Asked from Trees (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (2)
GATE CSE 2021 Set 1 (2)
GATE CSE 2020 (2)
GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (3)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (4)
GATE CSE 2006 (5)
GATE CSE 2005 (6)
GATE CSE 2004 (3)
GATE CSE 2002 (1)
GATE CSE 2000 (1)
GATE CSE 1998 (1)
GATE CSE 1997 (1)
GATE CSE 1996 (2)
GATE CSE 1991 (1)
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