Online Certification Guide » 100% Correct MCQ Answers

A binary search tree is generated by inserting in order the following integers:50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24

The number of the node in the left sub-tree and right sub-tree of the root, respectively, is a) (4, 7) b) (7, 4) c) (8, 3) d) (3, 8)

The maximum number of elements in a heap of height h is

a) 2h+1 -1 b) 2h c) 2h -1 d) 2h -1

When a binary tree is converted in to an extended binary tree, all the nodes of a binary tree in the external node becomes

a) Internal nodes b) External nodes c) Root nodes d) None

A binary search tree is formed from the sequence 6, 9, 1, 2, 7, 14, 12, 3, 8, 18. The minimum number of nodes required to be added in to this tree to form an extended binary tree is?

a) 3 b) 6 c) 8 d) 11

Which type of traversal of binary search tree outputs the value in sorted order?

a) Pre-order b) In-order c) Post-order d) None

Suppose we have numbers between 1 and 1000 in a binary search tree and want to search for the number 363. Which of the following sequence could not be the sequence of the node examined?

a) 2, 252, 401, 398, 330, 344, 397, 363 b) 924, 220, 911, 244, 898, 258, 362, 363 c) 925, 202, 911, 240, 912, 245, 258, 363 d) 2, 399, 387, 219, 266, 382, 381, 278, 363

The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?

a) 2h-1 -1 b) 2h+1 -1 c) 2h +1 d) 2h-1 +1

The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.

A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF

In linked representation of Binary trees LEFT[k] contains the _____ of at the node N, where k is the location.

A. Data B. Location and left child C. Right child address D. Null value

In threaded binary tree ……… points to higher nodes in tree.

A. Info B. Root C. Threads D. Child

If node N is a terminal node in a binary tree then its ………

A. Right tree is empty B. Left tree is empty C. Both left & right sub trees are empty D. Root node is empty

What is the expected time required to search for a value in a binary search tree containing n nodes? (You should make reasonable assumptions about the structure of the tree.)

A. O(1) B. O(log n) C. O(n) D. O(n log n) 15. E. O(n2 )

Which of the following tree traversal uses a queue data structure?

(A) Preorder (B) Inorder (C) Postorder (D) Level order

Which traversal of tree resembles the breadth first search of the graph?

(A) Preorder (B) Inorder (C) Postorder (D) Level order

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals?

(A) Preorder and Inorder (B) Preorder and Postorder (C) Inorder and Postorder (D) None of the Above

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:

(A) d e b f g c a (B) e d b g f c a (C) e d b f g c a (D) d e f g b c a