Having trouble with this if someone could please explain.

Which of the following are reasons why the red-black tree is considered more efficient than the AVL tree? (Select all that apply) Red-black trees are typically implemented using recursion rather than iteration. Although the code required to implement a red-black tree is generally considered to be more complex and harder to write than the code required to implement an AVL tree, it is nevertheless more efficient. Red-black trees only require a single, top-down pass to both add/remove an item and fix any imbalances that occur Red-black trees are typically implemented using iteration rather than recursion The code required to implement a red back tree is generally considered to be less complex and easier to write than the code required to implement an AVL tree Although red black trees still require two passes to add remove an item and fix any imbalances that occur, these passes can be executed in ever steps than the corresponding operations in an A L tree