搜索资源列表
exp8
- 对二叉树的删除、复制、中序遍历采用递归方式实现。 层序遍历采用辅助队列数据结构完成,为了计算层高, 使用了两个队列,交替的向两队列中插入相邻的两层, 这样完成层高的统计。-On the binary tree delete, copy, preorder recursive manner. Traversal sequence complete with assisted queue data structure, in order to calculate storey,
Tree
- 数据结构对二叉树结构的C++代码实现,包含基本的建立二叉树,各种方式遍历二叉树,深度计算、结点个数计算-Data structure of binary tree structure of the c++ code, include the establishment of the basic binary tree, various ways to traverse the binary tree, depth calculation and node number calculation,