搜索资源列表
二叉树的各种遍历方法—TreeVisit
- 包含二叉树先序、中序、后序的递归及非递归遍历，还有层次遍历、层次遍历从下到上、从左到右或者从右到左的遍历算法，并附加了测试代码
BinTreeExp
- 二叉树的创建、前序递归遍历、中序递归遍历、后序递归遍历、层次遍历、前序非递归遍历、中序非递归遍历、后序非递归遍历算法。里面包含了顺序栈和队列的实现代码。-Binary tree creation, pre-order recursive traversal, recursive in order traversal, postorder recursive traversal, traverse the level, pre-order traversal non-recursive, in t
erchashujiqixiangguancaozuo
- 二叉树及其相如按操作C程序代码 凹入表示法输出 二叉树的创建 结点内容用字符串表示 二叉树的节点数 叶子数 层次遍历 前序 中序 后序遍历 查找结点 删除结点 删除结点及其子树 再用凹入表示法输出-Binary Tree and its operation, such as by indentation C code representation of the output tree to create the content node tree with the string that lea
bitree
- 此代码描述的是对二叉树进行的操作！实验目的在于掌握二叉树的逻辑结构，存储结构已经对二叉树进行遍历操作！-This code is a binary tree described in the operation! Experiment aims to grasp the logic of binary tree structure, storage structure has been carried out on the binary tree traversal operation!
dd
- 二叉树先序遍历 实验代码 asd asd -Visiting Binary Tree Experiment code
AVLtree1
- 这是正确的AVLTree的代码，实现了二叉树的遍历，可以正确执行-This is the the a correct AVLTree code, binary tree traversal can be performed correctly
stutree
- 这段代码实现了二叉树的遍历，可以说是用树进行查找的实例之一-The code implements the traversal of a binary tree, we can say Find the instance of one of the tree
two-cha--pai-xu-tree-chunvzuo
- 实现排序二叉树三种遍历的代码。刚开始学习C程序，故有些水，这是我关于树类应用的处女作，望大家勿喷-Sorted binary tree three traversal code. Just started learning C program, some water, this is my debut on tree type applications, we hope not to spray Thank ...
traversal-of-binary-tree
- 软件基础实验中的二叉树遍历C代码，比较基础，希望可以通过-traversal of binary tree
ECSBL
- C语言二叉树遍历，数据结构C语言描述，很简单的算法和代码-C language binary tree traversal
Binary
- 本代码为C++的二叉树课设，内容包括复杂的建树过程，递归遍历及非递归遍历，还有二叉树形态的打印，功能还是比较全的-The code for C++ binary tree class-based, including the achievements of complex processes, recursive and non-recursive traversal traversal, as well as binary form printing function is still rel
TreeIterator
- 二叉树的构造、中序遍历的三种实现函数（递归、用栈、不用栈）的实现代码-Three binary tree structure, preorder implementation function (recursive, with a stack, not the stack) implementation code
erchashu
- 该代码文件实现了二叉树的一些基本操作，包括节点的遍历、增加删除等-The code files to achieve some basic binary operations, including traversing nodes increases delete
BinaryTree
- 二叉树在非递归算法中，后序遍历难度大，很多书上只给出思想或者几段无法直接调试的代码，甚至有些书上是错的，当时我在研究的过程中，就是按着书上错误的代码绕了好半天，几预抓狂。好在最终摸索出来了-Binary Tree in non-recursive algorithm, after the preorder is difficult, given the many books just thinking or paragraphs not directly debugging code, and
BianLiErChaShu
- 二叉树的遍历代码，包括二叉树的创建以及三种遍历方法-Binary tree traversal code, including the creation of a binary tree and three traversal methods
BinaryTree
- 本代码提供了二叉树前序、中序、后序遍历的三种遍历方法，实现了遍历的图形化演示，使用了初学者以及日常课程教学。-This code provides a pre-binary sequence, three traversal methods in sequence, after traversing achieve a traversal of the graphical presentation, using the beginner as well as the daily teaching
BinaryTree
- 二叉树前序中序后序遍历遍历代码，使用c++编写(Two fork tree preorder, in order, after traversal traversal code, using c++ write)
9月24日dom和事件代码
- 二叉树的遍历，二叉树的查找以及树的定义。字数字数字数(binary tree traversal traversal of binary tree)
trees
- 这是一个遍历二叉树的python代码，有兴趣的朋友可以下载来看看(This is the python source code used to describe trees. It can be combined with your actual needs.)
二叉树遍历操作
- 本代码采用c/c++语言，描述了二叉树的先中后序遍历及深度(This code uses c/c++ language to describe the first and middle traversal traversal and depth of two binary tree.)