Which term refers to a self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases?
- A. Dequeue
- B. Adjacency matrix
- C. B-tree ✓
- D. Dynamic array
Correct answer
C. B-tree
Explanation
B-tree refers to a self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.