Which type of binary tree is specifically designed to store key-value pairs and supports efficient search, insertion, and deletion operations?
A. AVL Tree
B. Red-Black Tree
C. B-Tree
D. Splay Tree
Answer: Option C
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion