answersLogoWhite

0

An AVL tree is another balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees to be proposed. Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time. Addition and deletion operations also take O(logn) time.

Definition of an AVL treeAn AVL tree is a binary search tree which has the following properties:
  1. The sub-trees of every node differ in height by at most one.
  2. Every sub-tree is an AVL tree.
User Avatar

Wiki User

11y ago

Still curious? Ask our experts.

Chat with our AI personalities

BeauBeau
You're doing better than you think!
Chat with Beau
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
More answers

An AVL tree is a self-balancing binary tree. It is similar in concept to a Red-Black tree, which is also self balancing, but it is more rigorously balanced. As a result, AVL trees tend to be slower on insert than Red-Black trees, but they are faster on retrieval.

User Avatar

Wiki User

13y ago
User Avatar

AVL tree is a height balanced trees whereas BST is not a height balanced tree..

User Avatar

Wiki User

11y ago
User Avatar

Add your answer:

Earn +20 pts
Q: IS AVL-Tree IS binary tree
Write your answer...
Submit
Still have questions?
magnify glass
imp