搜索资源列表
treestructuretraversalsequences
- 数据结构中的树形结构的层序遍历，仅仅是是对树的创建，销毁，遍历，插入等常规操作的c源代码-Data structure in the tree structure traversal sequences, only yes yes right tree creation, destruction, traversal, insertion and other conventional operations c source code
tree
- 二叉树的基本操作，例如前序遍历，后序遍历，层序遍历-tree
2
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。 二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 9、其他：自定义操作-According to a binary tree definition of abstract data types, use two forks to achieve a binary
BiTreeAll
- 使用二叉链表实现二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 -Use two forks linked to achieve the basic functions of a binary tree: 1, the establishment of two binary tree, preorder traversal b
BinTree1
- vc编写的二叉树的输入，前序遍历生成二叉树，利用层序遍历绘制二叉树-vc prepared binary input, before traversing a binary tree generated using a binary tree drawing traversal sequence
Binary_Tree
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。 二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 -According to the abstract data type binary definition, use two forks to implement a binary tree
tree
- 采用树的左右孩子存贮结构，实现树的先序、中序、后序及层序遍历。-About children with tree storage structure, to achieve the tree first order, in order, and postorder traversal sequence.
erchashu
- C作业：二叉树 先序建立，中序线索化，层序遍历，哈夫曼编码-C operation: binary tree preorder established in order cued, sequence traversal, Huffman coding
BitTree
- 具体功能函数有：建立二叉树、删除二叉树、前中后层序遍历-Specific functions of functions are: to establish tree, remove the binary tree, traversal sequence before, during, after
bitree
- 二叉树的遍历（前序遍历、中序遍历、后序遍历、层序遍历等）-Binary tree traversal (pre-order traversal, inorder traversal, postorder traversal sequence traversal, etc.)
erchashu
- 二叉树的建立，先序、中序、后序、层序遍历（递归和非递归方法），二叉树的高度、繁茂度，交换左右子树，统计叶子节点的数目，判断是否为完全二叉树，按树的形态在屏幕上打印输出；-failed to translate
tree
- 树操作大全(源码)，包括树的四种遍历方式，前序遍历、中序遍历、后续遍历、层序遍历，求树深-Tree operations Daquan (source), including the four tree traversal, preorder traversal, inorder traversal, the follow-up traversal, traversal sequence, find the tree depth
37116txt
- 任务： 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数； -Whereas it is essential, if man is not to be compelled to have recourse, as a last resort, to rebellion against tyranny and oppression, that human rights should b
rebuild-the-binary-tree
- 二叉树重建 scily1935 根据二叉树的前序遍历和中序遍历的节点序列,输出二叉树的层序遍历的节点序列-rebulit the binary tree
cengxubianli
- 层序遍历二叉树算法，构建一个二叉树，然后对其进行层序遍历-Sequence binary tree traversal algorithm, to build a binary tree, and then traverse its sequence
Huffman
- 数据结构 c语言/c++ 哈夫曼树先序中序遍历得到后序层序遍历-Data structures c Language/c++ Huffman tree in preorder traversal is the order traversal
bitree
- 二叉树的各种操作，插入、删除、统计深度、各层宽度、结点度为0、1、2的个数、先序、中序、后序遍历的递归以及非递归算法、层序遍历等操作-Binary tree operation, insert, delete, statistical depth layers width operation
verify-complete-binary-tree
- 构造一个排序二叉树，并对其进行层序遍历。-Constructs a sorted binary tree and its sequence traversal.
binarytree
- 二叉树的相关运算，包括先序遍历，中序遍历，后续遍历，层序遍历-Binary tree operations, including preorder traversal, in order traversal, subsequent traversal sequence traversal
BiTree
- 二叉树的构造和遍历,其中包括前序、中序、后序、层序遍历-The construction of bitree