搜索资源列表
binary-tree
- 二叉树算法 分别用前序、中序、后序遍历二叉树。-Binary tree algorithms were used to pre-order, in order, the order of traversal binary tree.
MyBiTree
- 完全二叉树的非递归前序遍历算法 一种比较好理解的方法-Complete binary tree pre-order traversal non-recursive algorithm is a relatively good understanding of the way
Creattree
- 中序建立二叉树及层次遍历 通过栈和队列的运用-Level in order to establish a binary tree and traverse through the use of stacks and queues
erchashubianli
- 实现二叉树的遍历，用C++实现，字数还没到啊-To achieve binary tree traversal, using C++ implementation, words not to ah. . .
experiment8
- 数据库实验：顺序表的基本操作，单链表的基本操作，栈的基本操作，队列的基本操作，二叉树建立及遍历操作，二叉树的应用程序设计，图的建立及遍历操作-Database eight experiments! Has more to do it, and we can refer to, hoping to help you.
BiTree
- 二叉树 先序遍历 中序遍历 后续遍历 构建一棵二叉树 递归算法-Preorder traversal of binary tree traversal in order to build up a binary tree traversal recursive algorithm
CSharp
- 二叉树的建立和各种遍历，Windows应用界面演示-Through the establishment and a variety of binary, Windows application interface demo
BinTree
- 这是一个二叉树前序遍历后序遍历中序遍历的源代码程序-This is a pre-order traversal binary tree in preorder traversal after traversal of the source code program
Binary_tree
- 二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树-Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the t
erchashu
- 二叉树的建立及查找，遍历二叉树数。有源程序，及遍历程序-er cha shu de cha zhao ji pian li
balanced-bianary-tree--traversal
- 平衡二叉树的遍历，左旋，右旋，左平衡，右平衡-Balanced binary tree traversal, L, D, left a balance, the right balance
rebuild-the-binary-tree
- 二叉树重建 scily1935 根据二叉树的前序遍历和中序遍历的节点序列,输出二叉树的层序遍历的节点序列-rebulit the binary tree
tree
- 数据结构中二叉树的基本操作，主要有建立、遍历、求深度等操作-The data structure of the basic operation of the binary tree, the main building, traverse, be in depth in operation
Lying-data-structure2
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；-" Westward the data structure," the main contents include: Introduction of data structures, algorithms, Big O-order method is derived sequence differ
Lying-data-structure9
- 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the m
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
erchashu
- 要求采用二叉链表作为存储结构，完成二叉树的建立，前序、中序和后序遍历的操作，求所有叶子及结点总数的操作等。具体实现要求：分别利用前序遍历、中序遍历、后序遍历所建二叉树。-Requires a list as a binary storage structure, the establishment of complete binary tree, the first order, the order and post order traversal of the operation, find
1
- 计算机数据结构中的层次遍历-二叉树（队）,属于C语言程序-The computer data structure level traversal-binary tree (team), belongs to the C language program
BiTree
- 实现的功能包括创建二叉树，按层遍历、递归遍历，统计度为0、1、2的节点数，求深度，判断是否是完全二叉树，求节点的父节点，交换左右子树，文件读写-create BiTree,traverse bitree,node s ancestor, exchange left and right childtree
xianxuzhongxu
- 用C语言实现的二叉树的先序遍历和中序遍历的源代码-er cha shu