搜索资源列表
erchashubianli
- 二叉树遍历问题是重要的问题。程序的实现简单而方便。-erchashu
binarytree
- 已知二叉树的任意两种遍历序列,可以得到树的第三种遍历序列。如已知先序和后序序列,输出中序序列。-Known binary tree traversal of any two sequences, can be the third tree traversal sequence. If known after the first sequence and the sequence sequence sequence sequence output.
tree
- 二叉树的创建、递归遍历算法及其它基本操作的实现-The creation of a binary tree, recursive traversal algorithm and the realization of other basic operations
BiTree
- 输入一个字符串,并建成一棵二叉树,满足左子树的字符都要小于根结点的字符,右字树的字符都要大于根结点的字符,每个结点值有字符和字符的出现次数,并用三种遍历方法打印,比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
cengcibianlierchashu
- C语言版的数据结构,利用层次遍历二叉树算法实现C语言的编程-C language version of the data structure, binary tree traversal algorithms using level C programming language
Depth-firsttraversalalgorithmforbinarytree
- 用c语言编程实现二叉树的深度算法遍历二叉树-Binary tree with c language programming to realize the depth of binary tree traversal algorithm
erchashu
- 二叉树的构建掌握基于先序遍历构造二叉链表的算法-Construction of binary tree
graph-theory-and-program-designe
- 详细的介绍了图论的各种概念如:分叉树,最短路径,遍历等以及相应的程序设计-A detailed descr iption of the various concepts of graph theory such as: the bifurcation tree, shortest path, traverse, and the corresponding program design
erchashu-
- C语言实现二叉树的创建 及先序、后序、层序遍历,输出树的深度,每一层节点个数,叶子总数-Creation and the first sequence of binary tree in C language, the order of the sequence traversal, output the depth of the tree, each layer the number of nodes, leaves the total number of
twotree
- 二叉树的非递归中序遍历+C代码 二叉树的非递归中序遍历+C代码 -two tree+C
birary-treea-and-integer
- 这是我的一个笔试题,是把整数放到二叉树中的一个题发上来给大家看看(采用中序遍历)。希望对大家找工作有帮助-This is a pen test, is the integer into a binary tree in a title made up for everyone to see (in preorder traversal). People looking for work
bitree
- 构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程-Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree trav
Tree
- 二叉树的相关功能,如遍历,求深度宽度繁茂度等-Functions of Binary Trees
5
- 二叉树的三种遍历,求深度、叶子,按层次遍历,-Binary tree traversal, and depth leaves hierarchy traversal
duijiaojuzhen
- 实现任意对角对称矩阵的压缩存储,可以便于树与图的存储,遍历等操作。-Any symmetric matrix diagonal compression and storage, easy tree storage traversal and other operations.
classical-algorithm-VCPP
- 常用的算法经典代码,包括快速排序,冒泡排序等各种排序方法,还有二叉树的前序、中序和后序遍历等-The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.
makingtree
- 学习树的创建与遍历,在实践中领悟树的奇妙。-learning to make tree and learn how to browse
Binary-Tree
- 对二叉树进行操作,包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
Cpp1
- 非递归中序遍历二叉树:要求从键盘输入二叉树各结点的值,并使用二叉链表来存储二叉树;使用非递归算法遍历二叉树,在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树:要求从键盘输入二叉树各结点的值,并使用二叉链表来存储二叉树;使用非递归算法遍历二叉树,在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t