Solution

The Correct answer is : A, B, C & D are correct.Key Points

• A. Red Black Tree: ✅ True
  A Red-Black Tree is a self-balancing BST that guarantees O(log n) time for search, insert, and delete operations in the worst case.
• B. Trie: ✅ True
  Tries (prefix trees) are used for efficient prefix-based searching and are common in applications like autocomplete and dictionary lookups.
• C. AVL Tree: ✅ True
  AVL Trees are also self-balancing BSTs with a stricter balancing condition than Red-Black Trees (balance factor must be -1, 0, or 1). So this statement is also true.
• D. B-Tree: ✅ True
  B-Trees are optimized for disk-based storage systems and support efficient search, insert, and delete operations with fewer disk reads.

Conclusion: All options A, B, C, and D are correct.