搜索资源列表
CppApplication_10_2_1
- 利用c++，栈，队列的方法，解决二叉树的遍历，递归非递归-Using c++, stacks, queues, solutions to the binary tree traversal, recursive non-recursive
Binary_tree_algorithm
- 二叉树的基本实现算法（创建、遍历递归和非递归算法）-The basic binary tree algorithm (create, recursive and non recursive traversal algorithm)
main
- 二叉树的递归中序遍历 数据结构和算法作业的小程序-Recursive in order traversal of binary tree data structures and algorithms operating in the small program
BalancedTree
- 平衡二叉树的建立和遍历。用C++实现的代码。-Balanced binary tree
Tree
- 二叉树的基本操作，包括创建二叉树，各种递归，非递归遍历算法等，最后用树形方式在控制台下打印出二叉树。-basic bit tree
erchashubianli
- 实现二叉树的建立和先、中、后序遍历二叉树以及求二叉树深度的功能。-To achieve the establishment and the first binary tree, during, and after traversing a binary tree and binary tree find the depth of functionality.
shu
- 生成树病并出它的前序、中序、后序遍历 在判断平衡二叉树-Spanning tree disease and a pre-order it, in order, after traversing a binary tree in determining the balance
third
- 利用二叉树的前序和中序遍历建立二叉树，删除二叉树-Use of binary tree traversal pre order and the establishment of a binary tree
bitree-bianli
- 输入根据用户的输入信息，建立二叉树的二叉链表。 利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。 -Enter the information based on user input, the establishment of binary binary tree list. Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve
BinarySearchTree
- 二叉搜索树，二叉搜索树的查找过程和次优二叉树类似，通常采取二叉链表作为二叉搜索树的存储结构。中序遍历二叉搜索树可得到一个关键字的有序序列，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。搜索,插入,删除的复杂度等于树高。-Binary search tree, binary search tree to find a si
erchashu
- 这是一个实现二叉树的三种遍历方式。有一个是将三种遍历方式运用到一起。-This is a realization of the three binary tree traversal. One is to use the three traversal together.
tree
- 1 建立二叉树 1）通过输入树的嵌套括号表示序列 2）根据前序遍历序列和中序遍历序列建立二叉树 3）建立哈夫曼树 2. 对于1中1），2）所建立的树进行如下操作： 1）查找结点 2）前序遍历 3）中序遍历 3 对于建立的哈夫曼树进行编码 4 输出二叉树的形状-1 Create a binary 1) by entering the sequence of the tree of nested brackets 2) According to the preorder traversal sequ
bintree
- C++实现求二叉树的深度（递归·非递归）·遍历（递归，非递归）-C++ realization for binary tree depth (recursion · the recursive) · traversal (recursion, the recursive)
hashu[1]
- 以前序建立一颗二叉树，并以中序、后序遍历，求深度和叶子节点-Before the establishment of a binary sequence, and in order, postorder traversal, seeking depth and leaf nodes
BinaryTree
- 二叉树的各种操作，包括插入，删除，遍历，搜索等-BinaryTree
lab6
- 用c++来实现的一个面向对象的二叉树。实现了插入，查找，删除，遍历等接口-Using c++ to achieve an object-oriented binary tree. Realized the insert, search, delete, traverse the other interface
main
- 数据结构中二叉树的递归非递归遍历搜索查找-Recursive binary tree data structure search to find non-recursive traversal
experiment
- C++语言用类实现二叉树递归非递归遍历搜索查找-C++ language implementation with a class of recursive binary tree search to find non-recursive traversal
tree
- 二叉树的各种运算的实现，文本文档，包括求深度、结点个数、遍历以及查找结点等。-Binary tree implementation of the various operations, including seeking depth, the number of nodes, traverse and to find other nodes.
bi_tree
- 二叉树数据结构，包括建立、遍历、希望对数据结构的初学者提供帮助-Binary tree data structure, including the creation, traversal, and I hope the data structure to help beginners