//
// bst.h
//
// This file contains the prototypes of functions in the
// binary search tree toolkit.  This toolkit assumes
// that the binary search trees are created using the binary tree
// toolkit from chapter 10 of the textbook and defined in bintree.h
//
// The three functions are: bst_search, bst_insert, and bst_delete.  
//

#include "bintree.h"

using namespace main_savitch_10;

//
// This function returns true if a node containing the value entry is in the
// binary search tree whose root is pointed to by node_ptr and false otherwise.
//
template <class Item>
bool bst_search(const binary_tree_node<Item> *node_ptr, const Item& entry);

//
// This function inserts a node containing the value entry into a binary
// search tree whose root node is pointed to by node_ptr.
//
template <class Item>
void bst_insert(binary_tree_node<Item>*& node_ptr, const Item& entry);

//
// This function removes a node containing the value entry from a binary
// search tree whose root is pointed to by node_ptr.
//
template <class Item>
void bst_remove(binary_tree_node<Item>*& node_ptr, const Item& entry);

#include "bst.template"