Which of the following description(s) is/are true?
A. Red-Black Tree – guarantees worst case 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 stricter balance criteria.
D. B-Tree – allows efficient search, insert, delete operations in disk-based systems.
Choose the correct answer from the options given below:

1. AA & B only
2. BC & D only
3. CB only
4. DA, B, C & D

Pick an option to check yourself, or open the answer below.