[permalink] [id link]

The AVL tree is named after its two Soviet inventors, G. M. Adelson-Velskii and E. M. Landis, who published it in their 1962 paper " An algorithm for the organization of information.

from
Wikipedia

## Some Related Sentences

AVL and tree

In computer science

**,**an__AVL____tree__**is**a self-balancing binary search__tree__**,****and****it**was**the**first such data structure to be invented**.**
In other words

__AVL____tree__**is**a binary search__tree__where**the**height**of****the**left subtree differs from**the**height**of****the**right subtree by at most 1 level**,**if**it**exceeds 1 level then rebalancing occurs**.**
Basic operations

**of**an__AVL____tree__involve carrying out**the**same actions as would be carried out on an unbalanced binary search__tree__**,**but modifications are preceded or followed by one or more operations called__tree__rotations**,**which help to restore**the**height balance**of****the**subtrees**.**
Tree rotations are used

**in**a number**of**__tree__data structures such as__AVL__trees**,**red-black trees**,**splay trees**,****and**treaps**.**
*

__AVL____tree__**,**red-black__tree__**,****and**splay__tree__**,**kinds**of**binary search__tree__data structures that use rotations to maintain balance**.**

AVL and is

Similar to red-black trees

**,**__AVL__trees are**in**general not weight-balanced**,**that__is__sibling nodes can have hugely differing numbers**of**descendants**.**
After inserting a node

**,****it**__is__necessary to check each**of****the**node's ancestors**for**consistency with**the**rules**of**__AVL__**.**
Automatic vehicle location (

__AVL__or ~ locating ; telelocating**in**EU )__is__a means**for**automatically determining**the**geographic location**of**a vehicle**and**transmitting**the****information**to a requester**.****The**main purpose

**of**using

__AVL__

__is__not only to locate

**the**vehicles

**,**but also to obtain

**information**about engine data

**,**fuel consumption

**,**driver data

**and**sensor data from i

**.**e

**.**doors

**,**freezer room on trucks or air pressure

**.**

Another scenario

**for**sensor functions__is__to connect**the**__AVL__to driver**information****,**to collect data about driving time**,**stops**,**or even driver absence from**the**vehicle**.**__AVL__technology

__is__predominately used when applying vehicle tracking to fleet or driver management solutions

**.**

Since only basic GIS

**information**__is__included**,**if__AVL__was available**,****it**would simply display service vehicle locations on a map**.**
If an

__AVL__system__is__used**,****the**CAD system will look through a list**of**most recent reported vehicle positions**.**
For example

**,**where everyone__is__used to**the**convenience**of**automatic vehicle location (__AVL__), an__AVL__outage can suddenly increase staff workloads**.**
A related device classification

**,**specific to**the**transportation industry**,**__is__called automatic vehicle location (__AVL__).
This

__is__loosely similar to__AVL__trees**,****in**that**the**actual rotations depend on ' balances '**of**nodes**,**but**the**means**of**determining**the**balance differs greatly**.**
Since

__AVL__trees check**the**balance value on every insertion / deletion**,****it**__is__typically stored**in**each node ; scapegoat trees are able to calculate**it**only as needed**,**which__is__only when a scapegoat needs to be found**.**

AVL and its

Under

**the**Valencian Statute**of**Autonomy**,****the**Acadèmia Valenciana de la Llengua (__AVL__) has been established as__its__regulator**.**
Because most

__AVL__consists**of****two**parts**,**GPS**and**GSM modem with additional embedded__AVL__software contained**in**a microcontroller**,**most__AVL__systems are fixed**for**__its__purposes unless they connect to an open bus system**for**expansion possibilities**.**

AVL and two

Specifically

**,**Lehman**and**Carey's article describes a T-tree balanced like an__AVL__**tree**:**it**becomes out**of**balance when a node's child trees differ**in**height by at least__two__levels**.**

AVL and .

__AVL__trees are often compared with red-black trees because they support

**the**same set

**of**operations

**and**because red-black trees also take O ( log n ) time

**for**

**the**basic operations

__.__

Because

__AVL__trees are more rigidly balanced**,**they are faster than red-black trees**for**lookup intensive applications__.__
Both

__AVL__trees**and**red-black trees are self-balancing binary search trees**,**so they are very similar mathematically__.____AVL__trees are more rigidly balanced than red-black trees

**,**leading to slower insertion

**and**removal but faster retrieval

__.__

* Simple implementation — simpler than other self-balancing binary search trees

**,**such as red-black trees or__AVL__trees__.__

AVL and M

0.090 seconds.