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?
Difficulty: Hard
About this MCQ
This Hard Data Structures question asks: 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? The correct choice is C. B-tree. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Data Structures items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Data Structures so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Data Structures item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Dequeue
Why not A: “Dequeue” does not fit this question. The answer is B-tree.
- B. Adjacency matrix
Why not B: “Adjacency matrix” does not fit this question. The answer is B-tree.
- C. B-tree ✓
- D. Dynamic array
Why not D: “Dynamic array” does not fit this question. The answer is B-tree.
Correct answer
C. B-tree
Explanation
B-tree is the term that matches “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” (option C). Option A (Dequeue) does not fit this question. Option B (Adjacency matrix) does not fit this question. Option D (Dynamic array) does not fit this question. For this Data Structures question, the accepted answer is B-tree.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- The following statement describes a specific concept. What is it called? a way of representing a graph using a...
- What is the name for a probabilistic data structure that uses multiple layers of linked lists to allow fast se...
- What is Adjacency list primarily used for?
- Which of the following best describes Skip list?
- Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neig...
- Identify the correct concept described as: a measure in a hash table calculated as the number of stored elemen...