1

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i] and the right child, if any, in X[2i+1]. To be able to store any binary tree on n vertices the minimum size of X should be

2

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is

3

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-0.3

The numbers 1, 2, ........, n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be

4

GATE CSE 2004

MCQ (Single Correct Answer)

+1

-0.3

Level order traversal of a rooted tree can be done by starting from the root and performing

Questions Asked from Trees (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2022 (1)
GATE CSE 2020 (2)
GATE CSE 2018 (1)
GATE CSE 2015 Set 1 (3)
GATE CSE 2015 Set 2 (2)
GATE CSE 2015 Set 3 (2)
GATE CSE 2014 Set 1 (1)
GATE CSE 2014 Set 3 (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

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude