|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <cstdlib>#include <ctime>#include <iostream>#include <string>#include <aleph.H>#include <tpl_avl.H>#include <tpl_binNodeUtils.H>#include <cassert>Go to the source code of this file.
Functions | |
| static void | print_pair (Avl_Tree< int >::Node *p, int, int) |
| static void | print (Avl_Tree< int >::Node *p, int, int) |
| int | main (int argc, char *argv[]) |
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 51 of file testAvl.C.
References Aleph::destroyRec(), Aleph::divide_and_conquer_partition_dp(), Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::getRoot(), Aleph::inOrderRec(), Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::insert(), is_avl(), keys, Aleph::preOrderRec(), print(), print_pair(), Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::remove(), and Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::search().