搜索资源列表
erchashu
- 1.递归先序遍历 2.递归中序遍历 3.递归后序遍历 4.非递归层序遍历 c语言
erchashu
- 使用中序遍历，先序遍历，后序遍历，交换左右子树，计算结点数，计算树的高度-Use traversal first traversal, after traversal exchange about subtree, computing nodes, computing the height of the tree
ERCHASHU
- 关于二叉树的一些基本操作，包括查找，添加，删除结点-About some of the basic binary tree operations, including search, add, delete node and so on
erchashu
- VC++编程，实现二叉树的创建及遍历。北航软件技术基础作业。-VC++ programming, to create and traverse a binary tree.