Data Structures | Balanced Binary Search Trees | Question 13

Which of the following is true about AVL and Red Black Trees?
(A) In AVL tree insert() operation, we first traverse from root to newly inserted node and then from newly inserted node to root. While in Red Black tree insert(), we only traverse once from root to newly inserted node.
(B) In both AVL and Red Black insert operations, we traverse only once from root to newly inserted node,
(C) In both AVL and Red Black insert operations, we traverse twiceL first traverse root to newly inserted node and then from newly inserted node to root.
(D) None of the above


Answer: (A)

Explanation: Refer Red Black Tree Insertion and AVL Tree Insertion

Quiz of this Question



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions