Vidyalelo
Data Structure · Q185

Binary Search Trees(B Tree)

Programming · Data Structure · question 185

Q185

When to choose Red-Black tree, AVL tree and B-trees?

A.
many inserts, many searches and when managing more items respectively
Answer
B.
many searches, when managing more items respectively and many inserts respectively
C.
sorting, sorting and retrieval respectively
D.
retrieval, sorting and retrieval respectively

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board