搜索资源列表
BiTree
- 数据结构二叉树的各种操作实现(包括基本操作和扩展操作),完美运行-Various operations to achieve binary tree data structure (including the basic operation and extended operations), a perfect run
binary_tree
- 二叉树的一些基本操作,建立,删除,增加删除节点,-Some of the basic operations of a binary tree, create, delete, delete nodes increases,
erchashudeyingyong
- 集成所有二叉树的基本操作。包括求子节点。求页。-Integrates all the basic operations of a binary tree. Including Praying nodes. Find pages.
one
- 程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。 1.先序次序建立一个二叉树 ,用#表示某结点的左右子树是否为空,用于表示该结点是否为叶子或者可能存在左子树or右子树。例如对一个简单的三节点二叉树,节点b和c分别为根节点a的左孩子和右孩子,用先序来创建就表示为ab##c## 2.按先序、中序、后序、层次遍历分别输出二叉树的所有节点 3.求二叉树中所有节点数 4.求二叉树的深度 -Program binary t
Bitree
- 二叉树的各种基本操作,附注释,十分适合初学者!-Basic operations of a binary tree, with notes, very suitable for beginners!
BinaryTree
- 该程序的功能是实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树 结构类型以及每一种操作的具体的函数定义和主函数。 -Feature of the program is the type definition and basic operations on binary tree node binary tree. The program includes a binary tree structure and the specific type of function defi
adfg
- 实验3.1 二叉树顺序存储结构基本操作实现实 验3.1 二叉树顺序存储结构基本操作实现-Experiment 3.1 binary sequence to achieve the basic operation of the storage structure
four_BiTree
- 二叉树的基本操作:建立、销毁、先序排序、中序排序、后序排序、广义表输出-The basic operation of a binary tree: create, destroy, first order sort, the sort order, the sort order, generalized table output
Balanced-Binary-Tree
- 基本实现平衡二叉树的创建,插入和删除操作。使用C++代码实现-Basic balanced binary tree to create and delete operation.
data-structure
- 数据结构基本算法:包括单链表操作、二叉树建立及遍历、基本的排序-The basic data structure algorithms: including single chain operations, binary tree traversal establish and basic ordering
huffman
- 用模板类实现哈弗曼编码,及二叉树的基本数据结构操作。-Template class that implements the Huffman coding, and basic binary tree data structure operations.
e
- 实现二叉树的基本操作:建立、遍历、计算深度、结点数、叶子数等。-Binary tree basic operations: the establishment, traverse, calculate the depth, the number of nodes, number of leaves and the like.
erchashu
- 进行一些二叉树的基本操作:1) 前序遍历:将二叉树按前序遍历输出; 2) 中序遍历:将二叉树按前序遍历输出; 3) 后序遍历:将二叉树按前序遍历输出; 4) 层序遍历:将二叉树按前序遍历输出; 5) 求高度:求出二叉树的高度; 6) 求最大宽度:求出二叉树的最大宽度; 7) 判断是否满二叉树: 判断所输入的二叉树是否满二叉树; -Some binary basic steps: 1) pre-order traversal: preorder output binar
hehe
- 这是二叉树的一些基本操作,有二叉树的建立、节点的删除和查找,排序等常用的功能。-These are some of the basic operations of a binary tree, there are common features delete and search, sort and other binary establishment nodes.
RedBlackTree
- 本文件为基于vs2010平台的使用C++语言的红黑树建立和操作。其中有二叉树的四种遍历方式,查找插入删除深度等基本操作。代码精心总结,有详细的注释,运行完全通过,结构清晰,对初学算法的人有很大帮助。-This document is a VS2010 platform using C++ language based on tree and operation. Which has four fork tree traversal method, to find the insertion an
shiyan
- 该程序的功能是实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。-The function of the program is the realization of binary tree node type definition and basic operation of binary tree. The program including the binary tree structure types, and each kind
xian-suo-shu
- 定义线索链表类型,实现线索二叉树的基本操作。-Define the list of clues to achieve the basic operation of the two fork tree.
er-cha-shu
- 定义二叉链表类型,实现二叉树的基本操作:建立、先中后序遍历、层次遍历及输出。-The definition of two fork list type, two fork tree to achieve the basic operation: the establishment, the first in the order traversal, hierarchical traversal and output.
4
- 《数据结构》 第4次上机题目 (二叉树练习 ) 1. 编程实现书P121 ADT BinaryTree 基本操作20个,用二叉链表结构实现; 2. 二叉树的先序、中序、后序遍历递归(非递归选做)方法,层次遍历。-" Data Structure" on machine 4th title (binary exercises) 1. Programming book P121 ADT BinaryTree basic operations 20, with binary
5
- 《数据结构》 第5次上机题目 ( 二叉树 图 练习 ) 1.编程实现书P156 ADT Graph 基本操作13个,用邻接矩阵存储结构实现; 2. 哈夫曼树的建立。-" Data Structure" 5th title on the machine (Fig binary exercises) 1. Programming book P156 ADT Graph 13 basic operations, using adjacency matrix storage s