In which scenario would an AVL tree be preferred over a Red-Black tree?
-
When insertions and deletions are more frequent than searches.
-
When search operations are more frequent than insertions and deletions.
-
When memory usage is a concern.
-
When the dataset is small.
