搜索资源列表
4feidiguisuanfa
- 遍历二叉树的4个非递归算法 vc编程基础，学生作业-binary tree traversal of the four non - recursive algorithm vc based programming, students work
LevelOrderTraverse
- 在链式存储结构条件下实现层次遍历二叉树的各个节点的操作。-Storage structure in the chain under the conditions of the various node-level binary tree traversal operation.
bintree
- 二叉树的实现遍历 添加 删除 可以实现tree的自动平衡~ -tree you can do that like this!
1
- 建立一颗用二叉链表方式存储的二叉树，并对其遍历，打印输出遍历结果。-The establishment of a list with the 2 fork stored in a binary tree, and its traverse, traverse the results printout.
balance_binary_tree
- 创建平衡二叉树，层次遍历平衡二叉树，计算平衡二叉树的树高。-Create a balanced binary tree, the level traversal balanced binary computing balanced binary tree.
InOrderThreadBiTree-(2)
- 手动输入各个结点建立二叉树(递归) ,普通二叉树的先序和后序遍历(递归),中序线索化(递归), 线索二叉树的先序和中序遍历(递归),线索二叉树的中序遍历(非栈、非递归), 层次遍历(使用队列),销毁整棵二叉树(递归)-Manually enter each node to build a binary tree (recursively), common binary tree inorder and postorder traversal (recursive), the sequence
erchashuquan
- 一个二叉树代码主要是二叉树的生成、插入、删除和遍历-A great code