搜索资源列表
Polynomialexpressionandcomputing
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a search along the line, followed on each node in the tree are done once and only one visit. Access node operation done depends on the
visitbinarytree
- 实现了向计算机输入一颗二叉树，并可以输出他的各种遍历结果-Input to the computer realization of a binary tree, and can output the results of his various traversal
traverse
- 输入一个二叉树的前序和中序遍历，程序给出此二叉树的后续遍历。-Input a preorder traversal and a midorder traversal of a binary tree.The program will show the after traversal of the binary tree.
recursivealgorithm
- 医院结构的树的实现，其中用到的是map容器。递归计算了医院的某个部件含有的子部件的个数，遍历计算-Hospitals to achieve the structure of the tree, which is used in the container map. Recursive calculation of the hospital containing components of a number of sub-components, traversing the calculation
RecursionOfTree
- 这个是关于迭代技术实现的文档，是关于二差遍历树的通用递归实现的设计-recursion
BinaryTree
- 二叉树的创建以及先序、中序、后序和层序遍历-welcome
FigureandTree
- 数据结构：最小生成树拓扑排序图的邻接表及遍历关键路径二叉树遍历-Data structures: minimum spanning tree topology of the adjacent table to sort and map the critical path traversal binary tree traversal
BinaryTrees
- 这是一个前序、中序和后序遍历二叉树的C++单文档Windows应用程序。-This is a preorder, inorder and postorder binary tree of C++ single-document Windows application.
BinaryTree
- （1）根据给定二叉树的先序遍历和中序遍历结果，构造出该二叉树； （2）给出该二叉树的后序遍历结果； （3）判定该二叉树是否为平衡二叉树； -(1) According to the given binary tree preorder traversal and inorder traversal a result, constructed out of the binary tree (2) given in the post-order traversal of the bin
tree
- 二叉树的前序，中序，后序，遍历等一系列操作-Binary tree preorder, inorder, postorder, traversing a series of operations
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
- 二叉树的构建和遍历和二叉树结点的插入。数据结构的实验。-Binary tree construction and traversal and insertion of binary nodes. Data structure experiment.
baseexp3
- 本实验由以下环节组成： 1） 存储结构 以二叉链表或三叉链表作为二叉树的存储结构； 2） 二叉树的创建(链式存储) 以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法； -In this study, composed of the following aspects: 1) The storage structure to two or three-pronged fork linked list is stored as a binar
binary_tree
- 这个程序是关于二叉树的实现。是去年做的，关于遍历二叉树之类的。-the implement of binary tree
BinaryTree
- 二叉树的创建，显示，前序，后序，中序遍历-Binary tree creation, display, pre-order, post order, the order traversal
a
- 二叉树的先序递归非递归遍历，中序递归非递归遍历，后序递归非递归遍历，以及节点数-Binary tree preorder recursive traversal non-recursive, recursive sequence of non-recursive traversal, postorder recursive non-recursive traversal. As well as the nodes
pretree
- 采用C语言编写的先序遍历二叉树的源程序，该程序有3部分构成：主程序，构造树函数，先序遍历函数-Written in C language using the first order binary tree traversal of the source, the program has three parts: the main program, construct a tree function, preorder traversal function
pengyunhui-4
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Llink-rlink stored using binary sort tree, write through keyboard input the establishment of two binary sort tree, and in the establishment of finished immediately display the results in
bitreefifth
- 二叉树的创建，线索化，遍历，表达式树求值等-Binary tree creation, threaded, traversal, expression tree evaluation, etc.
erchashubianli
- 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。将一棵二叉树的所有左右子树进行交换的算法。-Prepared using binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. Will be a left sub-tree of all binary ex