Time Left - 10:00 mins

GATE CS 2018 - Data Structures Quiz 5

Attempt now to get your rank among 654 students!

Question 1

Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Suppose there are m such numbers in T. If the tightest upper bound on the time to compute the sum is O(n^a log^b n + m^c log^d n), the value of a + 10b + 100c + 1000d is ________.

Question 2

Let T (n) be the number of different binary search trees on n distinct elements.
Then where x is

Question 3

A binary search tree contains the values 11, 22, 33, 44, 55, 66, 77 and 88. Which of the following is a valid preorder traversal?

Question 4

A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as

Question 5

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

654 attempts
2 upvotes
20 comments

Tags :

GATE & PSU CS Programming and Data Structures

Mar 24GATE & PSU CS