搜索资源列表
抽象数据类型实现
- 二叉树抽象数据类型的实现 问题说明：数据结构来实现二叉树具体函数功能的实现； 以及相关操作。-binary tree abstract data types realization : data structures to achieve specific function in a binary tree the realization; , and related operations.
3adf
- 遍历是二叉树各种操作的基础，显示，遍历过程中可以对各结点进行各种操作，又实现各种的目的。-traverse binary tree is the basis for various operations, that the process can traverse the nodes of various operations, Also achieve various objectives.
GameSceneMang
- 几篇关于游戏场景管理的方法介绍，其中包括二叉树、BSP树的详细内容。-few scenes management of the game on the way, including the binary tree, the BSP tree in detail.
TooTree
- 这是一个关于二叉树的运算程序,里面包有各种运算,大家可以看看.-This is a binary tree on the Operational procedures, which contain various operations, we will look at.
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and
源代码（vc++）
- 里面装有 5 个小程序，分别是：0-1背包问题、二叉树遍历、链式表的实现、迷宫路径、资源最优配置算法。每个程序都有详细的说明，是我这两个学期所做的实验的一部分。-containing five small programs, namely : 0-2-1 knapsack problem, the binary tree traversal and the chain table and that the realization of the maze path, the optimal res
svmBTA
- 一個基於二元樹為結構的svm分多類分類器svm-BTA,將分多類問題是為多個分二類問題，並結合二元樹的構造來達成分類功能。-A new approch for multi-classfication to employ binary tree architecture.
Chap4_BinaryTree
- 二叉树功能的实现，代码摘自PKU数据结构与算法课程网站。-Realization of Binary Tree functions, code taken from PKU data structures and algorithms courses website.
paxieeuew
- 1.创建二叉树 2.输出二叉树 4.二叉树的前中后三序遍历 5.删除特定关键字结点 0.退出程序-1. Create a binary tree 2. Output binary tree 4. Bintree three after the first traversal of 5. Delete specific keyword node 0. Exit procedures
5
- 在顺序存储结构中，利用编号表示元素的位置及元素之间孩子或双亲的关系，因此对于非完全二叉树，需要将空缺的位置用特定的符号填补，若空缺结点较多，势必造成空间利用率的下降。在这种情况下，就应该考虑使用链式存储结构。-Storage structure in order to use the element number that the location and elements of the relationship between children or parents, so for non-c
ch08
- 堆積（heap）是樹結構的第三種型態。堆積是一棵二元樹，其左右子樹節點的值均較其父母節點的值小。堆積的根節點值保證是該樹最大值。這中堆績稱為最大堆績。堆積的子樹可擺在左邊當左子樹，也可擺在右邊當右子樹，因此左右子樹俱有相同的性質。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
ch
- 堆积（heap）是树结构的第三种型态。堆积是一棵二元树，其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树，也可摆在右边当右子树，因此左右子树俱有相同的性质。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
binarytreealgorithm
- 一个排序二叉树算法的基本实现，C++初学者可以学习一下-Sort of a basic binary tree algorithm implementation, C++ beginners can learn about
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
Binarytreedemoprogram
- 本程序设计实现抽象数据类型二叉树的演示程序-Design and Implementation of the program abstract data types binary tree demo program
binarytree
- 已知二叉树的任意两种遍历序列，可以得到树的第三种遍历序列。如已知先序和后序序列，输出中序序列。-Known binary tree traversal of any two sequences, can be the third tree traversal sequence. If known after the first sequence and the sequence sequence sequence sequence output.
Binary_Trees
- 二叉树数据结构的讲义，全面介绍了完全二叉树、满二叉树的概念-Binary tree data structure of the lecture notes, a comprehensive descr iption of the complete binary tree, full binary tree concept
Program
- build binary tree in visual c-build binary tree in visual c++
l
- 用二叉树实现递归遍历 希望能对大家派上用处-Achieved using a binary tree recursively traverse want to put to use for everyone
BinaryTree
- 二叉树测试，二叉树的建立，测试等等。可以进行二叉树的学习，参考。-Binary test, binary tree, build, test and so on. Binary tree can be learning, reference.