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

A. O (n²)

B. O (n!)

C. O (log n)

D. O (1)

A. AVL tree

B. Red-black tree

C. Splay tree

D. B-tree

A. k+2 O (log (log n))

B. k O (log n)

C. K² O (log n)

D. k+1 O (log (log n))

A. O(1)

B. O(n)

C. O(logn)

D. O(nlogn)

A. by performing right rotation

B. by performing left rotation

C. by deleting both the elements

D. by inserting a new element