login/register

Snip!t from collection of Alan Dix

see all channels for Alan Dix

Snip
summary

AVL Trees
An AVL tree is another balanced binary search tree. Name ...

OOPWeb.com - Data Structures and Algorithms by John Morris
http://www.oopweb.com/Algorithms/Documents/PLDS210/VolumeFrames.html?...

[From frame: http://www.oopweb.com/Algorithms/Documents/PLDS2.../AVL.html]

Categories

/Channels/AVL trees

[ go to category ]

For Snip

loading snip actions ...

For Page

loading url actions ...

AVL Trees

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.

HTML

<table bgcolor="#00c0f0" cellpadding="0" cellspacing="0" width="100%"><tbody><tr><td><font face="helvetica" size="+2"><b>AVL Trees</b></font> </td></tr> </tbody></table> <p> An <font color="#fa0000"><b>AVL tree</b></font> is another balanced binary search tree. Named after their inventors, <b>A</b>delson-<b>V</b>elskii and <b>L</b>andis, 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 <b><i>O(</i>log<i>n)</i></b> search time. Addition and deletion operations also take <b><i>O(</i>log<i>n)</i></b> time.</p>