Interface of the Binary Search Tree Module

/*_##################################### #######################################
_##
### Interface of the Binary Search Tree Module
_ ## Author: xwlee
_ ## Time: 2007.01.01
### Chang'an University
_ ## Development condition: win2003 SERVER + vc6.0
_##
_ ## Bsearchtree. h file
_####################################### ###################################*/

// Tree element type.
# Define tree_type int

// -------------------------- External interface -------------------------------
// Add a new value to the tree. The parameter must not exist in the tree.
Void insert (tree_type value );

// Find a specific value. The function returns a pointer to this value.
Tree_type * Find (tree_type value );

// The execution tree's forward traversal. Its parameter is a callback function pointer, and the function to which it points will
// It is called to process each node in the tree. The Node value is passed to this function as a parameter.
Void pre_order_traverse (void (* callback) (tree_type value ));

// The execution tree's ordinal traversal. Its parameter is a callback function pointer, and the function to which it points will
// It is called to process each node in the tree. The Node value is passed to this function as a parameter.
Void mid_order_traverse (void (* callback) (tree_type value ));

// The post-order traversal of the execution tree. Its parameter is a callback function pointer, and the function to which it points will
// It is called to process each node in the tree. The Node value is passed to this function as a parameter.
Void back_order_traverse (void (* callback) (tree_type value ));

// -------------------------- External interface -------------------------------

// Temporary Function
Void treeprint ();