搜索资源列表
Bitree
- 二叉树的建立,与递归遍历,并求其深度-The establishment of a binary tree, and recursively traverse and find its depth
BinaryTree
- 二叉树的创建、遍历、以及左右子树交换,非递归遍历,叶子节点计算及线索树等完整程序. -BinaryTree:Create,preorder,inorder,postorder,treedepth,exchangetreeLR,ThreadingBiTree,and so on...
Binary-tree-traversal-structure
- 二叉树非递归遍历的源代码 数据结构实验 C语言编程-Binary tree traversal non-recursive data structure of the source code in C programming experiments
binary-tree
- 二叉树,编写程序任意输入二叉树的结点个数和结点值,构造一棵二叉树,采用三种递归遍历算法(前序、中序、后序)对这棵二叉树进行遍历并计算出二叉树的高度。-binary tree
source_code
- 1.排序算法:快排,插入排序,选择排序,冒泡排序,堆排,归并排序 2.无向图:建立邻接表,并深度遍历 3.二叉树:建树,插入叶子节点并删除,计算深度及高度,前序中序后序遍历,以及用栈实现的非递归遍历 4.二叉排序树:建树并插入、删除结点 5.通讯录:有主界面,能添加,删除查找相应的数据-1.sort:quicksort select sort,insert sort,heap sort.etc. 2.graph:create with the adjacent list,an
tree
- 实现二叉树的建立,以及先序,后续,中序的递归和非递归遍历-The establishment of a binary tree, and the first order, follow-up, in order recursive and non recursive traversal
bitree
- 1、以广义表的方式输入二叉树 2--7、三种递归、非递归遍历的结果 8、统计结点数、叶子数 9、求深度(递归、非递归) 10、以反中序方式打印树图的格式-A generalized table input binary tree 2- 7, three recursion, non-recursive traversal results 8, the statistics the number of nodes, leaf number 9, seeking dept
312010
- 1.掌握二叉树的基本概念和性质 2.掌握创建和构造二叉链表的算法 3.掌握二叉树链表存储基础的的三种递归遍历算法和非递归算法。 4.掌握计算二叉树的结点、二叉树的深度和二叉树的叶子结点数等算法。 5.掌握huffman树的构造和编码。 实验要求:(1)理解二叉链表的初始化、二叉树空的判断;(2)理解二叉树的遍历算法,掌握其应用。 -A. Grasp the basic concepts and properties of the binary tree. Master t
tree
- 二叉树的先序,中序,后序,层序的递归,非递归遍历-Binary tree preorder, inorder, postorder, the sequence of recursive, non-recursive traversal
Non-recursive-traversal
- 二叉树的非递归遍历完整源代码,对初学数据结构的人非常有用-Non-recursive binary tree traversal complete source code, useful for beginner data structure
BinaryTree
- 包括二叉树的前序、中序、后序递归非递归遍历;以及线索二叉树的前序、中序、后序递归非递归实现。-Include binary tree preorder, inorder, postorder recursive non-recursive traversal threaded binary preorder, inorder, postorder recursive non-recursive implementation.
TREE
- 实现二叉树非递归遍历,有利新手学习数据结构。-er cha shu fei di gui bian li
er-cha-shu-cao-zuo
- 二叉树的非递归遍历,利用栈,和队列来完成-Non-recursive traversal of a binary tree, using the stack, and queue
BiTree
- 1、 编写程序按先序次序输入二叉树中结点的值构造二叉链表表示的二叉树。 2、 编写程序采用三种递归遍历算法(前序、中序、后序)对这棵二叉树进行遍历。 3、 编写程序计算该二叉树的高度。-A writing program preorder order input binary tree represented by the value of the structure of the binary tree node binary list. 2, write a program usin
tree
- 二叉树的建立和先序递归遍历、中序递归遍历后序递归遍历并用递归算法求二叉树的叶子节点的个数-The number of recursive traversal sequence after the establishment of a binary tree and recursive preorder traversal, inorder recursive traversal and recursive algorithm and binary tree leaf node
erchashu
- 数据结构中二叉树的基本操作,如先序,中序,后序遍历,递归和非递归遍历-Basic operation binary tree data structure, such as the first-order, in-order, post-order traversal, recursive and non-recursive traversal
tree
- 二叉树的所有功能基本实现,遍历的多种形式,创建,查找,还有栈的引入,线索化,树的深度以及非递归遍历等等。-The basic realization of all the features of a binary tree traversal various forms, create, find, there are stacks of the introduction of the clues and the depth of the tree, as well as non-recursi
zuoye
- 二叉树遍历,包括前中后序递归遍历和计算椰子树和节点数-Binary tree traversal, including former in after sequence recursively traverse and calculation of coconut trees and the number of nodes
CPP
- 二叉树操作和简单应用实现 1) 输入节点,生成一棵二叉树; 2) 先根、中根、后根递归遍历;-Binary tree operation and a simple application to achieve 1) input node generates a binary tree 2) the first root, root, after root recursive traversal
binarytree
- 二叉树的初始化,节点搜索,删除,插入,递归遍历,堆栈遍历-Initialization, node of a binary tree search, delete, insert, recursive traversal stack traversal