Binary  Search Tree (contd)
•	BSTree ADT:
•	Constructor/destructor
•	Search(T& x);
•	Insert(const T& x);
•	Delete(T& x);
•	Ascend();
•	See the algorithms for search and insert from the board
•	BSTree is going to be derived from BinaryTree.
•	In class exercise: Write the template of class definition for BSTree.
template <class T>
class BSTree : public BinaryTree<T>
{
	void Insert(BinaryTreeNode<T>*& t, const T& x)
// write Delete and Search
	public:
	BSTree<T>& Insert(const T& x)
	{Insert(root,x); return *this;}
	BSTree<T>& Delete(T& x); // write this
	bool Search(T& x); // write this
	void Ascend() {BinaryTree<T>::InOutput();}
};