ExamSIDE
Questions (Powered by ExamGOAL)
Data Structures
Arrays
Marks 1Marks 2
Stacks and Queues
Marks 1Marks 2
Linked List
Marks 1Marks 2
Trees
Marks 1Marks 2
Graphs
Marks 1Marks 2
Hashing
Marks 1Marks 2
Previous Next
1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?
A
7 5 1 0 3 2 4 6 8 9
B
0 2 4 3 1 6 5 9 8 7
C
0 1 2 3 4 5 6 7 8 9
D
9 8 6 4 2 3 0 1 5 7
2
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?
A
(1 2 (4 5 6 7))
B
(1 (2 3 4) 5 6) 7)
C
(1 (2 3 4)(5 6 7))
D
(1 (2 3 NULL) (4 5))
3
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 ).
4
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
Previous Next
Questions Asked from Marks 1
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 2017 Set 1 (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
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization