GATE CSE 2008 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

I, II and IV are inorder sequences of three different BSTs

I is a preorder sequence of some BST with 439 as the root

II is an inorder sequence of some BST where 121 is the root and 52 is a leaf

IV is a postorder sequence of some BST with 149 as the root

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys.
I. 81, 537, 102, 439, 285, 376, 305
II. 52, 97, 121, 195, 242, 381, 472
III. 142, 248, 520, 386, 345, 270, 307
IV. 550, 149, 507, 395, 463, 402, 270
Suppose the BST has been unsuccessfully searched for key 273. Which all of the above sequences list nodes in the order in which we could have encountered them in the search?

II and III only

I and III only

III and IV only

III only

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

The following three are known to be the preorder, inorder and postorder sequences of a binary tree. But it is not known which is which. MBCAFHPYK KAMCBYPFH MABCKYFPH Pick the true statement from the following.

I and II are preorder and inorder sequences, respectively

I and III are preorder and postorder sequences, respectively

II is the inorder sequence, but nothing more can be said about the other two sequences

II and III are the preorder and inorder sequences, respectively

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

Which of the following is TRUE?

The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)

The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)

The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)

The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)

PREVIOUS NEXT

GATE CSE Papers

2024