Which of the following description(s) is/are true: A. Red Black Tree -…
2025
Which of the following description(s) is/are true:
A. Red Black Tree - Guarantees worst case of O(log n) time for search, insert & delete.
B. Trie - Used for efficient prefix - based searches.
C. AVL Tree - self balancing binary search tree with stricker balance criteria.
D. B- Tree - Allows efficient search, inert, delete operations in disk based system.
Choose the correct answer from the options given below:
- A.
A & B only
- B.
C & D only
- C.
B only
- D.
A, B, C & D only
Attempted by 159 students.
Show answer & explanation
Correct answer: D
Step 1 — Red-Black Tree (A): Guarantees worst-case O(log n) time for search, insert, and delete by maintaining balance through coloring rules and rotations.
Step 2 — Trie (B): Used for efficient prefix-based searches where lookup time depends on key length, not number of stored keys.
Step 3 — AVL Tree (C): A self-balancing BST with stricter balance criteria than Red-Black Trees, resulting in tighter height bounds (balance factor must be -1, 0, or +1 at every node).
Step 4 — B-Tree (D): A balanced tree structure optimized for block-based (disk) storage, supporting efficient search, insert, and delete while minimizing disk accesses.
Since all four descriptions accurately match the standard properties of these data structures, the correct answer is A, B, C & D.
A video solution is available for this question — log in and enroll to watch it.