What does B-tree refer to?
- A. A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases. ✓
- B. A matrix in which most of the elements are zero, often stored using specialized structures to save memory.
- C. A data structure that allows insertion and removal of elements from both the front and the back.
- D. An array-like data structure that automatically resizes itself as elements are added or removed.
Correct answer
A. A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.
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.