|
|
|
Viewing Version
4
of
'AVL tree'
|
[ view 'AVL tree'
|
back to history
]
| Title of object: |
AVL tree |
| Canonical Name: |
AVLTree |
| Type: |
Definition |
| Created on: |
2003-02-01 10:11:43.444808-05 |
| Modified on: |
2003-02-12 18:27:55.49503-05 |
| Classification: |
msc:05C75 |
Preamble:
% this is the default PlanetMath preamble. as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.
% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}
% there are many more packages, add them here as you need them
% define commands here |
Content:
An AVL tree is A balanced binary search tree where the height of the two
subtrees (children) of a node differs by at most one. Look-up, insertion, and
deletion are $O( \ln{n})$, where $n$ is the number of nodes in the tree.
The structure is named for the inventors, Adelson-Velskii and Landis (1962). |
|
|
|
|
|
