GATE CSE 2020 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2020

MCQ (Single Correct Answer)

-0.67

In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]? Assume that the number of reported elements is k.

$$\Theta \left( {\log n} \right)$$

$$\Theta \left( {\log n + k} \right)$$

$$\Theta \left( {k\log n} \right)$$

$$\Theta \left( {n\log k} \right)$$

GATE CSE 2020

Numerical

-0

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is _______.

Your input ____

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

What is the worst case time complexity of inserting n² elements into an AVL-tree with n elements initially?

$$\Theta \left( {{n^2}} \right)$$

$$\Theta \left( {{n^2}\log n} \right)$$

$$\Theta \left( {{n^4}} \right)$$

$$\Theta \left( {{n^3}} \right)$$

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?

20, 19, 18, 16, 15, 12, 11, 10

10, 11, 12, 15, 16, 18, 19, 20

11, 12, 10, 16, 19, 18, 20, 15

19, 16, 18, 20, 11, 12, 10, 15

PREVIOUS NEXT

GATE CSE Papers

2024