GATE CSE 2005 | Trees Question 56 | Data Structures

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:

2^{h – 1}

2^{h – 1} + 1

2^h – 1

2^h

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is

(n – 1)k + 1

n(k – 1) + 1

n(k – 1)

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is 5, 3, 1, 2, 4, 6, 8, 7. If the tree is traversed in post-order, the sequence obtained would be

8, 7, 6, 5, 4, 3, 2, 1

1, 2, 3, 4, 8, 7, 6, 5

2, 1, 4, 3, 6, 7, 8, 5

2, 1, 4, 3, 7, 8, 6, 5

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8, 5, 3, 2 Two new elements ”1‘ and ”7‘ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

10, 8, 7, 5, 3, 2, 1

10, 8, 7, 2, 3, 1, 5

10, 8, 7, 1, 2, 3, 5

10, 8, 7, 3, 2, 1, 5

PREVIOUS NEXT