|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <ctime>#include <cstdlib>#include <cassert>#include <iostream>#include <string>#include <aleph.H>#include <tpl_dynArray.H>#include <tpl_balanceXt.H>Go to the source code of this file.
Typedefs | |
| typedef BinNodeXt< int > | Node |
Functions | |
| void | print_node (Node *p, int, int) |
| void | print_key (Node *p, int, int) |
| int | main (int argc, char *argv[]) |
Definition at line 46 of file testBalance.C.
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 60 of file testBalance.C.
References Aleph::balance_tree(), Aleph::blossom_maximum_cardinality_matching(), Aleph::check_rank_tree(), Aleph::destroyRec(), Aleph::insert_by_key_xt(), Aleph::BinNodeXt< Key >::NullPtr, Aleph::preOrderRec(), print_key(), root(), Aleph::searchInBinTree(), and value.
| void print_key | ( | Node * | p, |
| int | , | ||
| int | |||
| ) |
Definition at line 54 of file testBalance.C.
Referenced by main().
| void print_node | ( | Node * | p, |
| int | , | ||
| int | |||
| ) |
Definition at line 48 of file testBalance.C.
References Aleph::BinNodeXt< Key >::get_key().