搜索资源列表
二叉树的遍历.rar
- 数据结构中的平衡二叉树的代码
本代码演示了平衡排序二叉树的实现,并用到了智能指针
- 本代码演示了平衡排序二叉树的实现,并用到了智能指针等技术-demonstration of the code balanced binary tree in order to achieve, and used an intelligent guide technology
顺序二叉树和树的复制及哈夫曼编码
- 顺序二叉树和树的复制及哈夫曼编码-sequence binary tree and the tree reproduction and Huffman coding
四分树的穷举
- 使用VC为编程语言,结合数据结构二叉树的概念,新编算法进行四分树的穷举。-VC to use programming language, combine the binary tree data structure concept, a new edition of the tree algorithm quarter of exhaustive.
二叉排序二叉树的建立
- 二叉排序树的建立是数据结构中许多二叉树算法实现的基础,本程序输入节点时,以-1表示输入结束-two forks of the tree data structure is the establishment of many of the binary tree algorithm based on the input node procedure, said the importation of 1 to the end
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
平衡二叉排序树的综合操作1
- 数据结构常用算法:平衡二叉排序树的综合操作 全部程序代码,在C环境编译通过。-algorithm commonly used data structures : a balanced binary sort tree all integrated operation code, the C compiler through the environment.
求二叉树的高度、叶子节点数
- 求二叉树的高度和深度,求高度时采用递归算法,求深度时采用非递归算法。-for binary tree height and depth, used for highly recursive algorithm, seeking depth of the use of non - recursive algorithm.
从数据库中加载树和动态添加树的节点例子
- 开发环境:VB.NET 从数据库中加载树和动态添加树的节点例子.该例子演示了如何从数据库中读出记录作为树的节点及动态加载节点-development environment : VB.NET from the database and dynamic loading tree nodes of the tree to add examples. The example demonstrates how to read the dat
遍历二叉树的4个非递归算法
- 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non - recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitabl
树的高度和叶子结点数
- 先是建立一个树,然后对树进行转换变成二叉树,求出树的高度和叶子节点,此程序对于数据结构学习者很有帮助-First, the establishment of a tree, the tree then converted into a binary tree, the tree calculated the height and leaf nodes, the procedure for data structure learners
二叉树
- 二叉树的个种增删查改及各种操作以及常见的面试题(Two tree additions and deletions, check, change operations, and common interview questions)
二叉树的基本操作
- 二叉树的先序,中序,后序,层序递归和非递归实现,总节点个数和叶子节点个数,二叉树的高度等基本操作(Two binary tree first order, middle order, backward sequence, sequence recursive and non recursive implementation, the total number of nodes and the number of leaf nodes,
树的转换.cpp
- Open Judge数据结构与算法树与森林练习题(http://openjudge.cn on this site)
二叉树
- 数据结构中二叉树的上机实验中遇到的二叉树的建立以及其他操作(Data structure in the two fork tree experiment on the establishment of the two fork tree and other operations)
二叉树的四种遍历方式与层序创建
- 本例程实现对于二叉树的四种遍历方式,先序,中序,后序,层序四种遍历(This routine implements four traversing methods for two forked trees, the first order, the middle order, the rear order and the sequence of four ergodicity.)
二叉树基本操作的程序实现
- 数据结构二叉树的基本操作,比较基础,初学者专用吧。。。(The basic operation of a binary tree)
8606-二叉树的构建及遍历操作
- 实现二叉树的遍历操作,属于数据结构基础算法,代码能够顺利运行,运行环境是ColdBlick。(The traversing operation of two forked tree belongs to the basic algorithm of data structure, the code can run smoothly, and the running environment is ColdBlick.)
二叉树的遍历
- 主要实现:创建二叉树、用先中后序遍历二叉树(中序,先序和后序遍历用非递归实现),并输出树高。(The main achievement is to create two branches tree, and use the first and middle traversal to traverse the two fork tree.)
二叉树遍历操作
- 本代码采用c/c++语言,描述了二叉树的先中后序遍历及深度(This code uses c/c++ language to describe the first and middle traversal traversal and depth of two binary tree.)