GATE CSE 2006 | Trees Question 61 | Data Structures

GATE CSE 2006

MCQ (Single Correct Answer)

-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

O(n)

O(log n)

O(nlog n)

O(n log log n)

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Which of the following sequences of array elements forms a heap?

{23, 17, 14, 6, 13, 10, 1, 12, 7, 5}

{23, 17, 14, 6, 13, 10, 1, 5, 7, 12}

{23, 17, 14, 7, 13, 10, 1, 5, 6, 12}

{23, 17, 14, 7, 13, 10, 1, 12, 5, 7}

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 55. Which of the following sequences CANNOT be the sequence of nodes examined?

{10, 75, 64, 43, 60, 57, 55}

{90, 12, 68, 34, 62, 45, 55}

{9, 85, 47, 68, 43, 57, 55}

{79, 14, 72, 56, 16, 53, 55}

GATE CSE 2005

MCQ (Single Correct Answer)

-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?

9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95

9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29

29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95

95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29

PREVIOUS NEXT