AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.AVLTree< Key extends Comparable Class Template Reference

Simple implementation of an AVL tree. More...

Detailed Description

Simple implementation of an AVL tree.

This implementation is based on BinarySearchTree and in particular BinarySearchTree#restructure for rebalancing.

This implementation does not implement removal of nodes! remove always throws
UnsupportedOperationException!

See also
aud.example.AVLTreeExample

Definition at line 14 of file AVLTree.java.

The documentation for this class was generated from the following file: