AVL Trees

Tobias Nipkow 🌐 and Cornelia Pusch

March 19, 2004

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Two formalizations of AVL trees with room for extensions. The first formalization is monolithic and shorter, the second one in two stages, longer and a bit simpler. The final implementation is the same. If you are interested in developing this further, please contact gerwin.klein@nicta.com.au.

License

BSD License

History

April 11, 2011
Ondrej Kuncar added delete function

Topics

Session AVL-Trees

Cite

× 
@article{AVL-Trees-AFP,
  author  = {Tobias Nipkow and Cornelia Pusch},
  title   = {AVL Trees},
  journal = {Archive of Formal Proofs},
  month   = {March},
  year    = {2004},
  note    = {\url{https://isa-afp.org/entries/AVL-Trees.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: