- Main Page
- Modules
- Namespaces
- Classes
- Files
- Directories
- Related Pages

- Alphabetical List
- Class List
- Class Hierarchy
- Class Members

# DataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType > Class Template Reference

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

`#include <DS_BinarySearchTree.h>`

Inheritance diagram for DataStructures::AVLBalancedBinarySearchTree< 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 | BalanceTree (typename BinarySearchTree< BinarySearchTreeType >::node *current, bool rotateOnce)
void | RotateRight (typename BinarySearchTree< BinarySearchTreeType >::node *C)
void | RotateLeft (typename BinarySearchTree< BinarySearchTreeType >::node *C)
void | DoubleRotateRight (typename BinarySearchTree< BinarySearchTreeType >::node *A)
void | DoubleRotateLeft (typename BinarySearchTree< BinarySearchTreeType >::node *A)
bool | RightHigher (typename BinarySearchTree< BinarySearchTreeType >::node *A)
bool | LeftHigher (typename BinarySearchTree< BinarySearchTreeType >::node *A)

## Detailed Description

### template<class BinarySearchTreeType>
class DataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >

An AVLBalancedBinarySearchTree is a binary tree that is always balanced.

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

- C:/RakNet 2.518/Include/DS_BinarySearchTree.h