login/register

Snip!t from collection of Alan Dix

see all channels for Alan Dix

Snip
summary

We show that, in order to achieve efficient maintenance ... binary search tree, no shape restriction other than a lo... is required. The obtained class of trees, general balanc... maintained at a logarithmic amortized cost with no balan... stored in t

General Balanced Trees - Andersson (ResearchIndex)
http://citeseer.ist.psu.edu/andersson99general.html

Categories

/Channels/AVL trees

[ go to category ]

For Snip

loading snip actions ...

For Page

loading url actions ...
We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the nodes. Thus, in the case when amortized bounds are sufficient, there is no need for sophisticated balance criteria. The maintenance algorithms use partial rebuilding. This is important for certain...

HTML

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the nodes. Thus, in the case when amortized bounds are sufficient, there is no need for sophisticated balance criteria. The maintenance algorithms use partial rebuilding. This is important for certain...

Search Alan Dix Snips

Channels - Alan Dix