BasicDataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType > Class Template Reference

An AVLBalancedBinarySearchTree is a binary tree that is always balanced. More...

#include <BinarySearchTree.h>

Inheritance diagram for BasicDataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >:

BasicDataStructures::BinarySearchTree< BinarySearchTreeType > List of all members.

Public Member Functions

void add (const BinarySearchTreeType &input)
void del (const BinarySearchTreeType &input)
BinarySearchTree< BinarySearchTreeType > & operator= (BinarySearchTree< BinarySearchTreeType > &original_copy)

Private Member Functions

void balance_tree (typename BinarySearchTree< BinarySearchTreeType >::node *current, bool rotateOnce)
void rotate_right (typename BinarySearchTree< BinarySearchTreeType >::node *C)
void rotate_left (typename BinarySearchTree< BinarySearchTreeType >::node *C)
void double_rotate_right (typename BinarySearchTree< BinarySearchTreeType >::node *A)
void double_rotate_left (typename BinarySearchTree< BinarySearchTreeType >::node *A)
bool right_higher (typename BinarySearchTree< BinarySearchTreeType >::node *A)
bool left_higher (typename BinarySearchTree< BinarySearchTreeType >::node *A)

Detailed Description

template<class BinarySearchTreeType>
class BasicDataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >

An AVLBalancedBinarySearchTree is a binary tree that is always balanced.


The documentation for this class was generated from the following file:
Generated on Fri Apr 7 21:34:25 2006 for RakNet by  doxygen 1.4.6-NO