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

8.2.3利用子指针数组的普通树后根遍历算法-8.2.3 the use of common sub-tree pointer array root traversal algorithm

传教士野人过河问题。主要介绍2种解决的方法：1 树的遍历 2 启发式搜索-Missionaries Savage across the river. Introduces two kinds of solution: a tree traversal heuristic search

用树的层号表示生成一棵树,然后分别用来测试前序遍历的递归与非递归算法,()