GATE CSE 2021 Set 1 | Trees Question 8 | Data Structures

PREVIOUS NEXT

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0.33

Consider the following statements.

S₁ : The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S₂ : The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?

S₁ is true and S₂ is true

S₁ is false and S₂ is true

S₁ is false and S₂ is false

S₁ is true and S₂ is false

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

GATE CSE 2018

Numerical

-0

The postorder traversal of a binary tree is $$8,9,6,7,4,5,2,3,1.$$ The inorder traversal of the same tree is $$8,6,9,4,7,2,5,1,3.$$ The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.

Your input ____