+1 vote
in Data Structures & Algorithms I by (110k points)
When to choose Red-Black tree, AVL tree and B-trees?

(a) many inserts, many searches and when managing more items respectively

(b) many searches, when managing more items respectively and many inserts respectively

(c) sorting, sorting and retrieval respectively

(d) retrieval, sorting and retrieval respectively

Query is from Red Black Tree topic in division Binary Trees of Data Structures & Algorithms I

This question was addressed to me during a job interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct option is (a) many inserts, many searches and when managing more items respectively

Easiest explanation - Red black when frequent inserts and deletes, AVL when less frequent inserts and deletes, B-tree when using paging from a slow storage device.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...