81. Disadvantages of linked list representation of binary trees over arrays?
82. AA-Trees makes more rotations than a red-black tree.
83. If A ꓵ B (A and B are two clusters) is a singleton set then it is a Merge able cluster.
84. Which of the following is not a random tree?
85. How many edges are present in path cluster?
86. Which of the following is a self - balancing binary search tree?
87. Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences.
S1: N, M, P, O, Q
S2: N, P, Q, O, M
S3: M, N, O, P, Q
S1: N, M, P, O, Q
S2: N, P, Q, O, M
S3: M, N, O, P, Q
88. Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
89. The number of edges from the node to the deepest leaf is called . . . . . . . . of the tree.
90. Which property makes top tree a binary tree?
Read More Section(Binary Search Trees(B Tree))
Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.