In threaded binary tree ……… points to higher nodes in tree.
A. Info B. Root C. Threads D. Child
Data Structures
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
What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree?
(A) O(n) for all (B) O(Logn) for all (C) O(Logn) for search and insert, and O(n) for delete (D) O(Logn) for search, and O(n) for insert and delete
In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which of the following order?
(A) left, root, right (B) root, left, right (C) right, root, left (D) right, left, root
A BST is traversed in the following order recursively: Right, root, leftThe output sequence will be in
(A) Ascending order (B) Descending order (C) Both sequence (D) No specific order
Which indicates pre-order traversal?
A. Left sub-tree, Right sub-tree and root B. Right sub-tree, Left sub-tree and root C. Root, Left sub-tree, Right sub-tree D. Right sub-tree, root, Left sub-tree
A binary tree whose every node has either zero or two children is called …….
A. complete binary tree B. binary search tree C. extended binary tree D. data structure
Sequential representation of binary tree uses ……..
A. Array with pointers B. Single linear array C. Two dimensional arrays D. Three dimensional arrays
A connected graph T without any cycles is called a ……..
A. A tree graph B. Free tree C. A tree d D. All of the above