Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

A. L N M O Q P T

B. N M O P O L T

C. L M N O P Q T

D. O P L M N Q T

A. true

B. false

A. self adjusting binary search trees

B. self adjusting binary trees

C. a tree with strings

D. a tree with probability distributions

A. O (log n)

B. O (n!)

C. O (n²)

D. O (1)

A. 2w and 2w+1

B. 2+w and 2-w

C. w+1/2 and w/2

D. w-1/2 and w+1/2

A. A, C, D, B, E

B. A, B, C, D, E

C. A, B, C, E, D

D. D, B, E, A, C

A. Complete Binary Search Tree

B. Perfect Binary Search Tree

C. Balanced Binary Search Tree

D. Degenerate Binary Search Tree

A. 1

B. 3

C. 2

D. 0

A. The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost

B. You should know the frequency of access of the keys, improves the lookup time

C. The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time

D. The tree should be just modified and improves the lookup time

A. it holds probability usage of the respective sub trees

B. any sequence of j operations starting from an empty tree with h nodes atmost, takes O(jlogh) time complexity

C. sequence of operations with h nodes can take O(logh) time complexity

D. splay trees are unstable trees