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:

  1. A & B only
  2. C & D only
  3. B only
  4. A, B, C & D only

Answer (Detailed Solution Below)

Option 4 : A, B, C & D only

Detailed Solution

Download Solution PDF

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.

More Tree Questions

Get Free Access Now
Hot Links: teen patti win yono teen patti teen patti gold teen patti star teen patti casino apk