搜索资源列表
Cpp1
- 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示:验证是否交换可以调用二叉树的遍历算法,比较输出结点序列 1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 创建的二叉树: -2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called
software
- 主要实现软件技术中的二叉树的遍历 数据的查找 多种排序法 文件里包括代码和原理-Main software technology to achieve the binary tree traversal Data Find A variety of sorting method Files, including code and principles of
erchashu
- 二叉树的遍历,简单的二叉树按先序,中序后序遍历-Binary tree traversal, a simple binary tree according to the first sequence, in order postorder traversal
btree
- 树型结构上机作业 1 建立二叉树 1)通过输入树的嵌套括号表示序列 2)根据前序遍历序列和中序遍历序列建立二叉树 3)建立哈夫曼树 2. 对于1中1),2)所建立的树进行如下操作: 1)查找结点 2)前序遍历 3)中序遍历 3 对于建立的哈夫曼树进行编码 4 输出二叉树的形状 -Operating a tree structure on the plane to establish binary 1), enter the tree th
code
- 本程序采用二叉树的数据结构,,以作为家谱成员及信息(profile)的存储结构,,个人信息包括姓名,,性别,配偶,出生,死亡日期等,,还包括人物编号ID,,附加信息(便于以后扩展需要),以二叉树的遍历搜索,修改,增加,删除等作为核心算法,,并通过MFC界面显示出来,,以windows树结构来展示底层的家谱信息.-family tree
tree
- 二叉树的遍历,用先序创建二叉树,再用先序、中序、后序递归遍历二叉树。-Binary tree traversal, with the first order to create a binary tree, then the first order, in order, the order of recursive binary tree traversal.
29
- 在一棵中序线索二叉树中,实现后根中序线索二叉树的遍历;在构造二叉树时进行线索化。-ThreadBinaryTree
5235
- 本代码实现了数据结构二叉树的遍历转化 容易 易懂 -This code implements the traversal binary tree data structure is easy to understand conversion
BiTree
- 根据二叉树表的表示建立二叉树,实现二叉树的遍历,并给出从根结点到给定结点的路径信息。练习二叉树的链式存储及其遍历方法-According to the table that the establishment of a binary tree binary tree, binary tree traversal implementation, and give from the root node to a given node' s path information. Practice
BinaryTree
- 本程序实现二叉树的遍历,绝对原创。质量高!-A very good program .
binary
- 实现二叉树的遍历及应用。C++编写,运行速度较快。-Implementation and application of binary tree traversal. C++ is written to run faster.
BiTree_MFC
- C++ MFC,实现二叉树的遍历(前序、中序、后序)可自行添加节点-C++ MFC, to achieve the binary tree traversal (preorder, inorder, postorder) can add their own nodes
circlelist
- 利用c语言实现二叉树的遍历,先序后序中序-Using c language binary tree traversal, the first order in the sequence after sequence
BinaryTree
- 利用数据结构,c语言,实现二叉树的遍历,递归非递归-Use of data structures, c language, to achieve binary tree traversal, recursive non-recursive
fwd3
- 利用C++语言,实现二叉树的遍历,前序中序后序,层序,递归非递归-Using C++ language, to achieve binary tree traversal, pre-order in the sequence after sequence, sequence, recursive non-recursive
CppApplication_10_2_1
- 利用c++,栈,队列的方法,解决二叉树的遍历,递归非递归-Using c++, stacks, queues, solutions to the binary tree traversal, recursive non-recursive
erchashu
- 二叉树的遍历二叉树的创建遍历中序前序后序-The creation of binary tree traversing a binary tree inorder traversal sequence after the pre-order
Tree
- 二叉树的遍历及显示,递归先序,递归中序遍历,递归后续遍历-Binary tree traversal and display
btree
- 二叉树的遍历、插入、删除以及求二叉树的高度-Binary tree traversal, insert, delete, and find the height of binary tree
bitree
- 二叉树的遍历(前序遍历、中序遍历、后序遍历、层序遍历等)-Binary tree traversal (pre-order traversal, inorder traversal, postorder traversal sequence traversal, etc.)