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

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. If only the root node does not satisfy the heap property, the algorithm to convert the complete binary tree into a heap has the best asymptotic time complexity of

3

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. If the root node is at level 0, the level of element X[i], i ≠ 0, is

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?

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