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

A. A binary tree that stores the sizes of subtrees in nodes

B. A binary tree with an additional attribute of weight

C. A height balanced binary tree

D. A normal binary tree

A. a tree which is balanced and is a height balanced tree

B. a tree which is unbalanced and is a height balanced tree

C. a tree with three children

D. a tree with atmost 3 children

A. Post order

B. Pre order

C. Post order

D. Randomized

A. AVL tree

B. Treap

C. Splay tree

D. Binary heap

A. dynamic sets, dictionaries, sequences, maps

B. heaps

C. sorting

D. storing strings

A. The storage required by stack and queue is more

B. The pointers in most of nodes of a binary tree are NULL

C. It is Difficult to find a successor node

D. They occupy less size

A. n+O(n)

B. 2n+O(n)

C. n/2

D. n

A. Erik Demaine

B. Mihai Patrascu

C. John Lacono

D. All of the mentioned

A. AVL Tree

B. Splay Tree

C. Top Tree

D. Ternary Tree

A. AA-tree

B. Red-Black tree

C. Both have an equal search time

D. It depends