Define Avl Tree?

1.	Define Avl Tree?
Answer» An empty tree is height balanced. If T is a non-empty BINARY tree with TL and TR as its LEFT and right subtrees, then T is height balanced if TL and TR are height balanced and │HL - hR│≤ 1 Where hL and hR are the heights of TL and TR respectively. An empty tree is height balanced. If T is a non-empty binary tree with TL and TR as its left and right subtrees, then T is height balanced if Where hL and hR are the heights of TL and TR respectively.

Answer»

An empty tree is height balanced. If T is a non-empty BINARY tree with TL and TR as its LEFT and right subtrees, then T is height balanced if

Where hL and hR are the heights of TL and TR respectively.

An empty tree is height balanced. If T is a non-empty binary tree with TL and TR as its left and right subtrees, then T is height balanced if

Where hL and hR are the heights of TL and TR respectively.

Discussion