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

A. logn (k+1) - 1

B. nk

C. log^k (n+1) - 1

D. klogⁿ

A. larger the order of B-tree, less frequently the split occurs

B. larger the order of B-tree, more frequently the split occurs

C. smaller the order of B-tree, more frequently the split occurs

D. smaller the order of B-tree, less frequently the split occurs

A. log2n

B. log2m

C. n

D. m

A. Rope Tree

B. Suffix Tree

C. Tango Tree

D. Top Tree

A. AVL tree

B. B-tree

C. Red-black tree

D. Both AVL tree and Red-black tree

A. Ɵ (n)

B. Ɵ (n!)

C. O (n²+ n1)

D. O (log n!)

A. Weiner's algorithm

B. Farach's algorithm

C. Lempel - Ziv - Welch's algorithm

D. Alexander Morse's algorithm

A. 2-3 tree requires less storage than the BST

B. lookup in 2-3 tree is more efficient than in BST

C. 2-3 tree is shallower than BST

D. 2-3 tree is a balanced tree

A. at most (n - 1)/2 keys

B. exact (n - 1)/2 keys

C. at least 2n keys

D. at least (n - 1)/2 keys

A. True

B. False