搜索资源列表
lll333
- 这是一个利用扩展先序二叉树建立二叉树,并采用先序,中序,后序进行遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and a first sequence, sequence, After traversal sequence for the algorithm!
fei333
- 这是一个利用扩展先序二叉树建立二叉树,且利用非递归算法进行中序遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and the use of non - recursive algorithm which preorder algorithm!
66
- 通过和用户交互的形式,按照先序遍历输入一个二叉树,二叉数采用数组的结构存储,按层次遍历给结点编号,父亲结点和左右孩子通过两个公式联系,如父亲结点是i,则左孩子为2i+1,右孩子为2i+2.初始数组均被赋成星号,用户理论上可以输入ASCII码以内的任何值,但为了利于验证,只能输入可见字符(除作为标志的星号,回车表示该结点没有数据). 该程序的先序建树,先序输出以及中序输出是采用栈和循环实现的,后序输出是用递归来实现的,在先序建树子程序中,利用反逻辑,将叶子结点,树建完成,和用户输入回车等情况用
twotrees
- 二叉树的数据结构算法 包括二叉树的创建、遍历、输出等，可以作为课程设计的原材料-Binary tree data structure algorithms, including tree creation, traversal, output and so on, can be used as raw materials for curriculum design
erchashubianli
- 此程序为c语言编写，可以实现二叉树的先，中，后遍历-This procedure for the c language, the first binary tree can be achieved, during and after the traversal
bitree
- 实现二叉树的基本功能，如构造一棵二叉树，在树中插入结点，先序后序中序遍历二叉树等功能-The basic function of the realization of binary tree, such as a binary tree structure, inserted in the tree nodes, in sequence after the first order binary tree traversal functions
Maptheepthoftraversal
- 数据结构对二叉树的深度遍历用进栈，出栈的方法。-The depth of the binary tree data structure traversal to use into the stack, a stack method.
5551
- 利用数据结构的知识生成一颗二叉树，利用非递归的算法遍历二叉树，主要借助栈来遍历二叉树-Data structures generated using a binary tree of knowledge, use of non-recursive binary tree traversal algorithm, the main stack to traverse binary tree with
66666
- 创建一颗线索二叉树，主要利用了数据结构的知识和递归算法，最后能够遍历整颗树的信息-Creating a threaded binary tree, the main advantage of the knowledge and recursive data structures algorithms, and finally be able to traverse the whole tree information
BTree
- 二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....
binary_tree
- 二叉树先序、后序遍历，节点插入、删除，用C实现，操作系统平台为linux系统-binary tree
arc
- 运用二叉树求代数表达式的值，将代数表达式的每个符号用二叉树结点表示，遍历图的每一结点，按结点值得不同采用不同运算方式-Solving algebraic expressions binary tree
Untitled1
- 二叉树的基本操作（有界面） 包括各项遍历 主要涵盖递归与非递归-binary tree the basic operating
Binary-tree-in-the-establishment
- 二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表-Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list
Sets-binary-tree-algorithm
- 本实例实现了二叉树相关的一系列算法，包括建立二叉树、二叉树的前序、中序和后序遍历、统计数的结点数和叶子结点数。-The examples of the binary tree algorithm, including the establishment of a binary tree, binary tree preorder, inorder, and postorder traversal, statistical number of nodes and leaf nodes.
Binary-arithmetic-operations
- 实现二叉树的常用操作算法：包括二叉树的建立、遍历、求高度、线索化等操作-Binary tree algorithm to achieve common actions include: the establishment of tree, traversal, seeking height, threaded and other operations
shu
- 数据结构C语言版 二叉树的三种遍历 简单易实现-C-language version of the binary tree data structure traversal is simple and easy to achieve three
er-cha-shu
- 一个二叉树遍历的例子，初学C++的人可以下载学习一下。-A binary tree traversal example, beginner C++ people can download to learn about.
avl-0.4
- 二叉树结构体实现，可直接使用，内置各种删除、查询、遍历、添加API-acl implyment
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th