bst.h

#ifndef BST_H_
#define BST_H_

/* A node structure for use with the
 * binary search tree.
 */
typedef struct  bst_node {
    char * data;
    struct bst_node * right;
    struct bst_node * left;
} bst_node ;


/* Adds a value to the binary search tree.
 * Parameters:
 *  root - the pointer to the root of the tree
 * Return value:
 *  none
 */
void add ( bst_node ** root, char * word );


/* Prints the values stored in the bst to standard output according to
 * the inorder traversal. The values should be separated
 * by a single space.
 * Parameters:
 *  root - the root of the tree
 * Return value:
 *  none
 */
void inorder ( bst_node * root ) ;


/* Removes the node with the smallest value
 * in the tree.
 * Parameters:
 *  root - the pointer to the root of the tree
 * Return value:
 *  the string from the removed node or
 *  NULL if no node was removed.
 */
char * removeSmallest (  bst_node ** root );


/* Removes the node with the largest value
 * in the tree.
 * Parameters:
 *  root - the pointer to the root of the tree
 * Return value:
 *  the string from the removed node or
 *  NULL if no node was removed.
 */
char * removeLargest (  bst_node ** root );



///////////////////////////////////
// Add other declarations below. //
///////////////////////////////////

//bst_node *addRecurse(bst_node **root, char *word, bst_node *node);


/* creates a new node.
 * Parameter:
 *  data - the data for the new node
 * Return:
 *  new node
 */
 bst_node * newNode(char * data);

/* finds smallest node
 * Parameter:
 *  root - the pointer to the root of the tree
 * Return:
 *  smallest node
 */
bst_node *smallest(bst_node *root);


/* finds largest node
 * Parameter:
 *  root - the pointer to the root of the tree
 * Return:
 *  largest node
 */
bst_node *largest(bst_node *root);

#endif