搜索资源列表
BinaryTrees
- 这是一个前序、中序和后序遍历二叉树的C++单文档Windows应用程序。-This is a preorder, inorder and postorder binary tree of C++ single-document Windows application.
Create_and_bianli_BiTree
- c语言实现的 算法思想: 根据完全二叉树的定义,对完全二叉树按照从上到下,从左到右的层次序遍历应该满足: (1)某节点没有左孩子,则一定无右孩子 (2)某节点缺左或右孩子,则其所有后继一定无孩子。 若不满足上述任何一条,均不为完全二叉树。 (3) 利用栈先序遍历 -c language implementation of the algorithm is thinking: According to the definition of complete binary
erchashu
- 本程序包括二叉树的创建,各种遍历方法(前序,中序,后序以及各层算法)。-This process includes the creation of a binary tree, various traversal methods (pre-order, middle order, post order, and layers of algorithm).
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
main
- 使用c或c++实现树的三种遍历,利用数据结构是树-Using c or c++ implementation of the three kinds of tree traversal, using the data structure is a tree
rebuild
- 根据先序和中序遍历的结果,重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree
satg
- 二叉树的建立和遍历c++语言非递归和递归实现-The establishment and traverse binary tree c++ language implementation of non-recursive and recursive
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.
bintree
- 二叉树的实现遍历 添加 删除 可以实现tree的自动平衡~ -tree you can do that like this!
23442
- 实现二叉树的中序,先序,后序三种遍历的功能。-Binary tree in order to achieve first order, the order of three kinds oftraversal functions.
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
capi-0.01.tar
- < 多任务下的数据结构与算法>>一书的配套源代码,含有链表、哈希表、红黑树、AVL树、复合二叉树、无碎片内存管理、垃圾内存管理、多任务遍历等源代码-" " Multi-tasking data structures and algorithms under the " " a book supporting the source code, containing lists, hash tables, red-black tree, AVL
tree
- 二叉树的创建、递归遍历算法及其它基本操作的实现-The creation of a binary tree, recursive traversal algorithm and the realization of other basic operations
binary_tree
- 这个程序是关于二叉树的实现。是去年做的,关于遍历二叉树之类的。-the implement of binary tree
TreeDepth
- 通过遍历二叉树,求二叉树的深度 使用是先输入各节点的数据,再得出二叉树的深度-By traversing a binary tree, find the depth of use is the first binary input data on each node, and then arrive at the depth of binary tree
BinaryTree
- 二叉树的创建,显示,前序,后序,中序遍历-Binary tree creation, display, pre-order, post order, the order traversal
cplnx016_src.tar
- 在快速、 灵活的分析引擎。 分析在步骤 4: (1) 定义语法,(2) 加载到 ClearParse 的语法,(3) 调用,以将分析该的源的引擎和 (4) 遍历分析树约 在运行时更改您的文法。-The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse th
algorithm
- 非常实用的非递归二叉树遍历算法,可以解决许多生活中时机的问题-Very useful non-recursive binary tree traversal algorithm that can solve many problems in life time