What is the main property that distinguishes an AVL tree from a Red-Black tree?

AVL trees are always balanced, Red-Black trees are not
Red-Black trees allow for more unbalanced structures than AVL trees
AVL trees can have a maximum height difference of 2, Red-Black trees can have a maximum height difference of 1
Both trees are identical in balancing properties

What is the main property that distinguishes an AVL tree from a Red-Black tree?

Step 1: Understand that both AVL trees and Red-Black trees are types of self-balancing binary search trees.
Step 2: Know that the main goal of both trees is to keep the tree balanced to ensure efficient operations like search, insert, and delete.
Step 3: Learn that AVL trees maintain a stricter balance by ensuring that the heights of the two child subtrees of any node differ by at most one.
Step 4: Recognize that Red-Black trees allow for a bit more imbalance compared to AVL trees, meaning they can have a greater difference in height between child subtrees.
Step 5: Conclude that the main property distinguishing them is that AVL trees are more rigidly balanced than Red-Black trees.

No concepts available.