搜索资源列表
tree_exp
- 实现二叉树的生成，遍历，交换等功能，采用链表，可以很好的数据的读取和存储-To achieve the formation of a binary tree, traverse, exchange and other features, using the list, can be very good read and store data
tree
- 按先序遍历的扩展序列建立二叉树的存储结构 二叉树先序、中序、后序遍历的递归算法 二叉树中序遍历的非递归算法 二叉树层次遍历的非递归算法 求二叉树的深度(后序遍历) -By first traversing the expansion of the storage structure of binary sequences to establish the first order binary tree, in order, after traversing a binary
TREE
- 采用孩子史弟链表的方法建立树的存储结构，并用队列的方法实现，求树的深度,-Adopt child History brother list method establish tree storage structure and use queue method implementation, seeking tree depth
processcreat
- 进程创建模拟 针对操作系统中进程创建相关理论进行实验。要求实验者输书提供的代码并进行测试。代码简化了进程创建的多个步骤和内容。进程的树形结构采用广义二叉树的方式进行存储。-Process simulation for the operating system in the process of creating theories to create the experiment. Asked the experimenter to provide written input and teste
btree
- 用b树实现的一种文件管理，模拟b树的存储，对文件进行增删修改，等操作。-B Tree with a document management, simulation b tree storage, changes, additions or deletions to the documents, and other operations.
NO4
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Stored using llink-rlink binary sort tree, the preparation of the keyboard input through the establishment of binary sort tree, and build complete immediately display the results of the
Huffman_encode
- 这是一个霍夫曼编码的程序，是利用霍夫曼树等相关算法解决的。在程序中，随机产生的10个字符，利用子函数： HC=HuffmanCoding(HT,HC,w,3) 则可以获得每个元素的码字，存储的方式是通过一个指针的指针。-This is a Huffman coding process is the use of Huffman tree related algorithms to solve. In the process, the randomly generated 10 charact
data_struct6
- 数据结构课后设计题第六章 6.33③ 假定用两个一维数组L[1..n]和R[1..n]作为 有n个结点的二叉树的存储结构， L[i]和R[i]分别指 示结点i的左孩子和右孩子，0表示空。试写一个算法 判别结点u是否为结点v的子孙。-Data structure design question after class VI 6.33 ③ assumed with two one-dimensional array L [1 .. n] and R [1 .. n] as an
Haffmantree
- 进行哈夫曼树的建立，并且以哈夫曼树的存储形式输出-Huffman tree for the establishment, and to output the Huffman tree storage
shiyanbaogao
- 数据结构试验报告册，其中包括了线性表的基本操作，栈和队列的基本操作，稀疏矩阵的运算，二叉树的基本操作，图的存储和应用，查找运算实现，排序运算实现的C程序和调试结果。-Basic operation, the stack and queues are the basic operation of the matrix and operation of the basic operation of the tree, storage and application, the lookup opera
BiTree
- 根据二叉树表的表示建立二叉树，实现二叉树的遍历，并给出从根结点到给定结点的路径信息。练习二叉树的链式存储及其遍历方法-According to the table that the establishment of a binary tree binary tree, binary tree traversal implementation, and give from the root node to a given node' s path information. Practice
12
- 掌握堆的定义、存储结构及原理 2、掌握堆的运算 3、掌握哈夫曼树的定义 4、掌握构造哈夫曼树的方法 -Grasp the definition of the heap, storage structure and principle of two, master of the heap operations 3, 4 to grasp the definition of Huffman, Huffman tree construction methods of control
chenlin
- 以二叉链表作为存储结构 由用户输入一棵二叉树 使用菜单界面 分别输出二叉树的先序、中序和后序遍历下的结点访问次序 输出二叉树的深度 输出二叉树中所有的叶子结点及其数目。-Linked list to binary storage structure from user input as a binary tree binary tree using the menu interface, the output of the first order, respectively,
tree
- 二叉树的存储类型说明、使用二叉链表的方法来建立二叉树。-Binary storage type instructions, use the binary method to create a binary tree list.
ISAM
- 基于B-树的信息存储，支持插入、删除、搜索、对B-树的信息定制等各种操作。-Information restore based on the B-tree.Founctions like insert、delete and search can be supported.
TREE
- 二叉树的建立，存储，遍历,删除,查找叶子结点,并求所在层次-The establishment of a binary tree, store, traverse, delete, find leaf nodes, and where the level of demand
Chap5_Tree
- 树（森林）类结构的源码。其中包括存储、逻辑结构和附带的功能，封装性很好。可以直接#include使用。-Tree (forest) class structure of the source. Including storage, logical structure and function with the package is very good.# Include can be used directly.
Chap4_BinaryTree
- 二叉树类代码。其中包括逻辑结构、存储结构和各种增删查找的功能。需要用的时候只需#include "BinaryTree.h"即可-Binary tree class code. Including logical structure, storage structure and function of a variety of additions and deletions are looking for. When needed just# include " BinaryTree.h
src
- 图书管理系统的一个模拟程序。采用C语言编写。采用B树进行存储运行-A library management system simulation program. Using C language. Store run by B tree
Bitree
- 二叉树实现数据结构存储资料的详细功能、包含内容说明,尽量不要让站长把时间都花费在为.-The bitree is used to describe the storage of stastistics.