|
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_binNodeXt.H>#include <tpl_binNodeUtils.H>#include <tpl_binTree.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 42 of file testBinNodeXt.C.
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 56 of file testBinNodeXt.C.
References Aleph::check_bst(), Aleph::check_rank_tree(), Aleph::destroyRec(), Aleph::divide_and_conquer_partition_dp(), Aleph::find_position(), Aleph::inorder_position(), Aleph::inOrderRec(), Aleph::insert_by_key_xt(), Aleph::insert_by_pos_xt(), keys, l, Aleph::BinNodeXt< Key >::NullPtr, num_nodes, Aleph::preOrderRec(), print_node(), r, Aleph::remove_by_key_xt(), Aleph::remove_by_pos_xt(), root(), Aleph::searchInBinTree(), Aleph::select(), Aleph::select_rec(), and Aleph::split_pos_rec().
| void print_key | ( | Node * | p, |
| int | , | ||
| int | |||
| ) |
Definition at line 50 of file testBinNodeXt.C.
| void print_node | ( | Node * | p, |
| int | , | ||
| int | |||
| ) |
Definition at line 44 of file testBinNodeXt.C.
References Aleph::BinNodeXt< Key >::get_key().
Referenced by main().