What is AVL tree?

Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also known as self balancing tree.

So BF=h(T(left sub tree))-h(T(right sub tree));

Tagged . Bookmark the permalink.

One Response to What is AVL tree?

  1. 94Wilhelmina says:

    Hello blogger, i must say you have high quality posts here.
    Your website can go viral. You need initial traffic only.
    How to get it? Search for: Mertiso’s tips go viral

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.