GATE CSE concept:binary-search-trees PYQs & Answers — Page 2

Questions 11–13 of 13. Imported answers require independent review unless marked reviewed.

Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in

time IV. A binary search tree can be constructed from a max-heap in

time Which of the above statements are TRUE?

Your answerChoose one option.

I, II and III

I, II and IV

I, III and IV

II, III and IV

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let

be a binary search tree with 15 nodes. The minimum and maximum possible heights of

are:

Note: The height of a tree with a single node is 0.

Your answerChoose one option.

4 and 15 respectively

3 and 14 respectively

4 and 14 respectively

3 and 15 respectively

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:

Your answerChoose one option.

2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20

2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12

7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12

7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE concept:binary-search-trees PYQs

Question 40

Question 6

Question 36