搜索资源列表
5.6.1
- 1、二叉树的创建和遍历演示 1）从键盘输入二叉树的各结点值，按先序递归方式创建二叉树 2）分别实现先序、中序、后序递归遍历二叉树 3）输出二叉树的按层次遍历序列 4）输出二叉树的中序非递归遍历下的结点访问次序-1, binary tree traversal of the creation and demonstration of 1) from the keyboard input of the binary tree node value, according to firs
erchashubianliywc
- 只要就是用来实现二叉树遍历的功能，用c++语言实现的，是比较精简的数据结构。-erchashu bianli gongneng
bitree_operation
- 二叉排序树的建立，也包括二叉树的遍历程序，有多种处理二叉树的功能。-Binary sort tree establishment, but also of the tree traversal process, there are several functions to deal with binary tree.
erchashu
- 数据结构二叉树的遍历 例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历-例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历
Tree
- C语言写的二叉树基本算法，可以用 作数据结构学习的参考资料-C language written in the basic binary tree algorithm
tree
- 建立二叉树，实现其中序遍历（递归，非递 归），求二叉树高度，叶子个数，先序线索二叉树-The establishment of binary tree, the realization of one traversal (recursive, non-recursive), and tree height, leaf number, the first order binary tree leads
zhongxubianli
- 二叉树生成及遍历。以某种形式建立二叉树逻辑结构信息，建立二叉链表，先作先序、中序、后序遍历，将二叉树中序线索化，中序遍历线索二叉树-Tree generation and traversal. Some form of information to establish the logical structure tree, the establishment of binary list, to make the first order, in sequence, after the trave
DataStructureCourseDesignBinaryTreeTraversal
- 一个非常经典的原创的数据结构课程设计--二叉树的遍历-相信大家非常xihuan -A very classical structure of the original curriculum design data- Binary Tree Traversal- I believe we are very xihuan
shujujiegou
- 实现对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s
bitree
- 数据结构完成二叉树遍历，包括递归和非递归-Complete binary tree data structure traversal, including recursive and non-recursive
090619
- 理解二叉树特别是完全二叉树的性质，掌握二叉树的存储结构（二叉链表）；熟练掌握二叉树的常用操作算法（初始化、插入结点、删除结点、遍历等）；初步掌握二叉树的应用。-Binary tree in particular, to understand fully the nature of binary tree, binary tree master storage structure (List Binary) proficiency in commonly used binary tree alg
tree
- <1>将一棵树（或森林）转换为二叉树。 <2>求森林的高度。 <3>按层次方式遍历森林。 <4>输出一个森林中每个结点的值及其对应的层次数。 <5>输出一个森林的广义表形式，如下图中的森林的输出为：-< 1> will be a tree (or forest) into a binary tree. < 2> for the high forest. < 3> by way of tra
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and t
BtreeMFC
- 二叉树及二叉平衡树的实现 并且用MFC动态演示 数据结构课程设计-good
BiTree
- 二叉树的实现,实现创建二叉树，遍历二叉树，删除节点等-the development of Bitree
BiTree
- Java实现的二叉树，采用先序递归创建以及三种递归访问-Binary Tree Java achieved using the first sequence, as well as the creation of three recursive recursive visit
Conversion of binary tree and the tree
- 二叉树与树的转换 数据结构重要知识 上课时候老师布置的一个大作业 希望可以帮助到大家 -Conversion of binary tree and the tree
11
- 二叉树遍历及深度，使用C语言实现，课程设计-Binary tree traversal and depth of C language, curriculum design
MyIntTree
- 用java实现的二叉树，实现了add（），contains（），clone（），equals（），someContends（）等方法-The realization of the binary tree using java to achieve the add (), contains (), clone (), equals (), someContends (), etc.
datastruct.
- 数据结构课程设计使用报告，包括，二叉树的，图的，电话号码系统的-Curriculum design using data structures, including, tree and graph, telephone number system