1
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. The index of the parent of element X[i],i≠0 is?
2
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Which of the following sequences of array elements forms a heap?
3
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
How many distinct binary search trees can be created out of 4 distinct keys?
4
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Postorder traversal of a given binary search tree T produces the following sequence of keys
10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29
Which one of the following sequences of keys can be the result of an inorder traversal of the tree T?
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