Advanced Trees (AVL, RedBlack, BTrees) MCQ question and answer with solution | Data Structure MCQs

A. O (log M)

B. Exponential to Length of Tree

C. O (M!)

D. Linear to Length of Tree

A. all leaves are at the same level

B. it is perfectly balanced

C. postorder traversal yields elements in sorted order

D. it is B-tree of order 3

A. Trie requires less storage space than hashing

B. Trie allows listing of all the words with same prefix

C. Tries are collision free

D. Trie is also known as prefix tree

A. True

B. False

A. Ɵ (n)

B. Ɵ (n!)

C. Ɵ (1)

D. O (log n!)

A. True

B. False

A. B + tree allows only the rapid random access

B. B + tree allows only the rapid sequential access

C. B + tree allows rapid random access as well as rapid sequential access

D. B + tree allows rapid random access and slower sequential access

A. O (log n!)

B. O (n!)

C. O (n²)

D. O (n)

A. True

B. False

A. True

B. False