搜索资源列表
CLanguageforthedepthofproceduresbinarytree
- 求二叉树深度与节点数的集合，递归与非递归方法
BiTree
- 1.构建二叉树 2.编写递归算法，交换二叉树的左右子树； 3.输出按先序遍历得到的新二叉树结果。 -1 build a binary tree 2 write a recursive algorithm, exchange the left and right binary subtree 3 preorder traversal of the output obtained by a new binary tree results.
binarytree
- 二叉树的操作，程序采用递归可进行树的遍历，求叶子节点的个数，交换左右子树等操作-Binary operation, the procedure can be carried out using recursive tree traversal, and the number of leaf nodes, exchange and other operations around subtree
bitree
- 编写递归算法，在二叉树中求位于先序序列中第k个位置的结点的值- Write a recursive algorithm, and seeking in the first sequence binary sequence of k-th position of the value of a node
3_1
- 若用二叉链表作为二叉树的存储表示，试针对以下问题编写递归算法： 统计二叉树中叶结点的个数。 -If using the binary tree as a binary tree stores that try to prepare for the following recursive algorithm: Statistics mid-binary number of nodes.
ER
- 二叉树的先序中序后序递归以及非递归遍历，二叉树的叶子节点等功能-Preorder in sequence after sequence of recursive and non-recursive traversal of a binary tree, the binary tree leaf nodes and other functions
1
- 用C语言实现二叉树的先序、中序和后序的递归算法。-Using C language binary tree recursive algorithm first sequence, sequence and subsequent of.
aaa
- 二叉树的创建、插入、删除操作，计算二叉树的深度，获取二叉树的双亲结点、兄弟结点信息，计算二叉树的叶子数，二叉树的递归遍历、层次遍历-The basic function of binary Three implementation