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
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 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
What is common in three different types of traversals (Inorder, Preorder and Postorder)?
(A) Root is visited before right subtree (B) Left subtree is always visited before right subtree (C) Root is visited after left subtree (D) All of the above (E) None of the above
Which of the following traversal outputs the data in sorted order in a BST?
(A) Preorder (B) Inorder (C) Postorder (D) Level order