answersLogoWhite

0


Best Answer

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

10y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

13y ago

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.

This answer is:
User Avatar

User Avatar

Wiki User

11y ago

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

This answer is:
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
Related questions

How many types of binary tree?

A binary tree is type of tree with finite number of elements and is divided into three main parts. the first part is called root of the tree and itself binary tree which exists towards left and right of the tree. There are a no. of binary trees and these are as follows : 1) rooted binary tree 2) full binary tree 3) perfect binary tree 4) complete binary tree 5) balanced binary tree 6) rooted complete binary tree


Are binary tree and binary tree same?

Yes.


Copy of binary tree?

Is another binary tree.


When converting binary tree into extended binary tree all the original nodes in binary tree are?

will remain same


Does binary tree and binary search tree same?

no they are not same


What are the application of binary tree in computer science?

What are the applications of Binary Tree.


What is meant by left skewed binary tree?

a binary tree with only left sub trees is called as left skewed binary tree


What is incomplete binary tree?

Incomplete Binary Tree is a type of binary tree where we do not apply the following formula: 1. The Maximum number of nodes in a level is 2


What is the difference between strictly binary tree and complete binary tree?

Complete Binary tree: -All leaf nodes are found at the tree depth level -All nodes(non-leaf) have two children Strictly Binary tree: -Nodes can have 0 or 2 children


What is the difference between extended binary tree and complete binary tree?

Complete Binary tree: All leaf nodes are found at the tree depth level and All non-leaf nodes have two children. Extended Binary tree: Nodes can have either 0 or 2 children.


What is the difference between extended binary tree and a binary search tree?

A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.


What is the different between a binary search tree and a binary tree?

self depend friend"s............