动态查找表的设计与实现,实现抽象数据类型：二叉查找树。实现下列操作:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素.

-Dynamic look-up table of the design and implementation to achieve the abstract data types: binary search tree. To achieve the following: construct an empty table, destroy the table, the search element of the specified keyword, insert a new element, delete the specified keyword element traverse all the elements in the table.