NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
1

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)
Consider the following rooted tree with the vertex labelled P as the root The order in which the nodes are visited during an in-order traversal of the tree is
A
SQPTRWUV
B
SQPTRUWRV
C
SQPTWUVR
D
SQPTRUWV
2

GATE CSE 2011

MCQ (Single Correct Answer)
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A
B
C
D
3

GATE CSE 2008

MCQ (Single Correct Answer)
Which of the following is TRUE?
A
The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)
B
The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)
C
The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)
D
The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)
4

GATE CSE 2007

MCQ (Single Correct Answer)
The maximum number of binary trees that can be formed with three unlabeled nodes is:
A
1
B
5
C
4
D
3

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12