testBinNodeUtils.C File Reference

#include <cstdlib>
#include <ctime>
#include <iostream>
#include <string>
#include <tpl_dynArray.H>
#include <tpl_binTree.H>
#include <tpl_binNodeUtils.H>
#include <cassert>

Include dependency graph for testBinNodeUtils.C:

Go to the source code of this file.

Classes
struct	Clave
	Key structure for DFS tree nodes. More...
struct	Cargar_Clave

Functions
static void	printNode (BinTree< int >::Node *node, int, int)
static void	print_node (BinTree< int >::Node *node, int, int)
static void	print_node (BinTree< int >::Node *node, int, bool)
static void	fill_preorder (BinTree< int >::Node *node, int, int pos)
static void	fill_inorder (BinTree< int >::Node *node, int, int pos)
static void	fill_postorder (BinTree< int >::Node *node, int, int pos)
int	main (int argc, char *argv[])

Variables
DynArray< int >	preorder
DynArray< int >	inorder
DynArray< int >	postorder

Function Documentation

fill_inorder()

static void fill_inorder ( BinTree< int >::Node *  node, int  , int  pos  )

static

Definition at line 68 of file testBinNodeUtils.C.

References inorder.

Referenced by main().

fill_postorder()

static void fill_postorder ( BinTree< int >::Node *  node, int  , int  pos  )

static

Definition at line 76 of file testBinNodeUtils.C.

References postorder.

Referenced by main().

fill_preorder()

static void fill_preorder ( BinTree< int >::Node *  node, int  , int  pos  )

static

Definition at line 60 of file testBinNodeUtils.C.

References preorder.

Referenced by main().

main()

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 100 of file testBinNodeUtils.C.

References AH_ERROR, Aleph::areEquivalents(), Aleph::check_bst(), Aleph::copyRec(), Aleph::destroyRec(), Aleph::divide_and_conquer_partition_dp(), fill_inorder(), fill_postorder(), fill_preorder(), Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), inorder, Aleph::inOrderRec(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), Aleph::insert_root(), Aleph::level_traverse(), postorder, Aleph::postOrderRec(), preorder, Aleph::preOrderRec(), print_node(), printNode(), Aleph::GenBinTree< NodeType, Key, Compare >::remove(), Aleph::save_tree(), Aleph::GenBinTree< NodeType, Key, Compare >::search(), Aleph::searchInBinTree(), Aleph::DynArray< T >::size(), Aleph::split_key(), and Aleph::split_key_rec().

print_node() [1/2]

static void print_node ( BinTree< int >::Node *  node, int  , bool    )

static

Definition at line 52 of file testBinNodeUtils.C.

print_node() [2/2]

static void print_node ( BinTree< int >::Node *  node, int  , int    )

static

Definition at line 47 of file testBinNodeUtils.C.

Referenced by main().

printNode()

static void printNode ( BinTree< int >::Node *  node, int  , int    )

static

Definition at line 42 of file testBinNodeUtils.C.

Referenced by main().

Variable Documentation

inorder

DynArray<int> inorder

Definition at line 66 of file testBinNodeUtils.C.

Referenced by avl_to_btreepic(), Aleph::build_tree(), build_tree(), fill_inorder(), inorder(), main(), read_from_stream(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and TEST().

postorder

DynArray<int> postorder

Definition at line 74 of file testBinNodeUtils.C.

Referenced by fill_postorder(), main(), Aleph::For_Each_Postorder< Node >::operator()(), Aleph::For_Each_Postorder< Node >::operator()(), Aleph::For_Each_Postorder< Node >::postorder(), and Aleph::For_Each_Postorder< Node >::traverse().

preorder

DynArray<int> preorder

Definition at line 58 of file testBinNodeUtils.C.

Referenced by avl_to_btreepic(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::build(), Aleph::build_tree(), build_tree(), fill_preorder(), main(), Aleph::For_Each_Preorder< Node >::operator()(), Aleph::For_Each_Preorder< Node >::operator()(), Aleph::Tree_Node< T >::preorder(), preorder(), Aleph::For_Each_Preorder< Node >::preorder(), Aleph::preorder_to_bst(), read_from_stream(), Aleph::For_Each_Preorder< Node >::traverse(), and Aleph::Tree_Node< T >::traverse().