搜索资源列表
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作。包括树的（先序、中序、后序）创建、树的遍历（先序、中序、后序）、树的高度、树的宽度、树的叶子节点数-The basic operation of a binary tree. Including tree (first order, in sequence after sequence) created tree traversal (first order, in sequence after sequence), tree height, tree width, tree
binarytree
- 二叉树的递归（先序，中序，后序）遍历，创建叶子结点数，二叉树深度-Recursive binary tree (first order, in sequence, after the order) traversal, create leaf nodes, tree depth
Tree
- 二叉树的创建，二叉树的先序、中序、后序和层序遍历，树叶的统计，层数的统计-The creation of a binary tree, binary tree first order, in sequence, after the traversal and layers, leaves statistics, statistical layers
All-the-basic-binary-tree
- 二叉数的全部基本操作，包括二叉树的建立及各种遍历，二叉树的各种信息，二叉树的各种操作-Total number of binary operations, including the establishment of tree and a variety of traversal, binary tree variety of information, a variety of binary operations
Binary-tree-traversal
- 二叉链表遍历，可以使用递归和非递归方法实现二叉树的前序，中序和后续遍历，以及层序遍历-Binary tree traversal, you can use recursive and non-recursive method to achieve binary tree preorder, inorder traversal and follow-up, as well as layer preorder
Tree
- 源程序（C语言）对二叉树进行了一些基础操作，包括二叉树的初始化，遍历（先序）输入，凹入表输出等。-Source code (C language) had some basis for binary operations, including the initialization of a binary tree traversal (first order) input, recessed table output.
22
- 二叉树的创建，排序，交换,三种遍历方法，还有输出和比较.-Create a binary tree, sorting, switching, three traversal methods, as well as output and compared.
123
- 二叉树的基本操作，包括二叉树的建立、高度统计、广度统计、前序遍历等。-The basic binary operations, including the establishment of a binary tree, height statistics, breadth statistics, pre-order traversal.
TreeIterator
- 二叉树的构造、中序遍历的三种实现函数（递归、用栈、不用栈）的实现代码-Three binary tree structure, preorder implementation function (recursive, with a stack, not the stack) implementation code
shujujiegou
- 输入字符序列，建立二叉链表。 （2）先序、中序、后序遍历二叉树:递归算法。 （3）先序遍历二叉树:非递归算法（最好也能实现中序，后序非递归算法）。 （4）求二叉树的叶子个数。 （5）借助队列实现二叉树的层次遍历。 （6）在主函数中设计一个简单的菜单，分别调试上述算法。-Enter the character sequence to build the binary tree. (2) first order, in sequence, after the b
bitree
- 这个源代码的功能是二叉树的递归和非递归遍历。-The function of the source code is a binary tree recursive and non-recursive traversal.
BinaryTree
- 完整二叉树类的实现(包含测试文件)功能涵盖建树、删除左右子树、归并两棵树、二叉树的前序、中序、后序及层次遍历-Complete binary tree class implementation (including test files) function covers achievements, left sub-tree delete, merge two trees, binary tree preorder, inorder, and postorder traversal level
erchashu
- 二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）-Chain store binary tree, preorder traversal and hierarchy traversal.
1
- 二叉树的基本操作（1）在二叉链表上设计和实现下列二叉树运算的算法 ① 设计递归算法，实现：删除二叉树，求二叉树的高度，求二叉树中叶子结点数，复制二叉树，交换二叉树的左右子树。 ② 设计算法，按自上到下，自左向右的次序，即按层次遍历一棵二叉树。-The basic operation of a binary tree (1) the design and implementation of the following binary operation on the binary tree algo
binary-tree
- 二叉树的基本功能：1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt，并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树，并以缩格形式打印出交换前-The basic function of a binary tree: a tree in order to generate a list stored in binary binary bt (node tree can be customized) 2 be
btree
- 二叉查找 包括 中序遍历 插入 删除 查找 打印二叉树等各种 有关于二叉树的操作-Binary search, including preorder insert delete find various operations, such as printing a binary tree binary tree about
BinaryTree
- 创建二叉树，先序、中序、后序遍历二叉树的递归及非递归，和按层次便利二叉树的实现-Create a binary tree, preorder, inorder, postorder recursive and non-recursive binary tree, and at different levels to achieve a convenient binary tree
binary_tree
- 这是数据结构二叉树的实现，包括创建，删除，遍历等十几种操作，基本涵盖所有的操作。-This is the realization of a binary tree data structure, including the creation, deletion, traversal dozen operations, covering all operations.
erchashu
- 该代码文件实现了二叉树的一些基本操作，包括节点的遍历、增加删除等-The code files to achieve some basic binary operations, including traversing nodes increases delete
InOrderThreadBiTree-(2)
- 手动输入各个结点建立二叉树(递归) ,普通二叉树的先序和后序遍历(递归),中序线索化(递归), 线索二叉树的先序和中序遍历(递归),线索二叉树的中序遍历(非栈、非递归), 层次遍历(使用队列),销毁整棵二叉树(递归)-Manually enter each node to build a binary tree (recursively), common binary tree inorder and postorder traversal (recursive), the sequence