Search - 2-3-4 tree

Search - 2-3-4 tree - List

[Other] careerman DL : 0: 第1题_向量链表功能应用.txt 第2题_双向链表功能应用.TXT 第3题_扩充双向链表的功能.TXT 第4题_二叉树功能应用.TXT 第5题_利用二叉树功能解决实际问题.TXT 第6题_利用二叉树进行四则运算.txt-an article that _ Vector Chain function application. Txt No. 2 _ and that two-way linked list functional applications. TXT No. 3 _ and that the expansion of two-way Chain function. TXT 4 _ that function application binary tree. TXT No. 5 _ and that the use of binary tree functions to solve practical problems. TXT 6 that _ use binary tree for four computing. txt
Date : 2025-12-17 Size : 93kb User : 赵文明
[Other] 综合实验哈夫曼编码 DL : 0: 1．n个叶结点,权分别为w1,w2,• • • ,wn的二叉树中，带权路径长度WPL最小的二叉树叫最优二叉树，也叫霍夫曼树。 2．霍夫曼算法：1）根据给定的权值{w1,w2,• • • ,wn}构造n个二叉树F={T1,T2,• • • ,Tn}每个Ti只有一个根结点，权为wi。2）在F中选取两棵根结点的权值最小的树构成一棵新的二叉树，其根的权值为左右子树根的权值的和。3）F中删去这两棵树，加上新得的树。4）重复2）3）直到只剩一棵树。 -1. N leaf nodes, the right to w1, w2,# 8226# 8226, wn the binary tree, with the right path length WPL smallest binary tree called Optimal binary tree, the tree is also called Hoffman. 2. Hoffman algorithm : 1) According to the weights (w1, w2,# 8226# 8226# 8226, wn) n binary tree structure F = (T1, T2,# 8226# 8226# 8226, Tn) each only a Ti Root, the right to wi. 2) In 1984 two F Root in the value of the right to the smallest tree constitute a new binary tree, the roots of the right value for the son around the roots and the value of the right. 3) F deleted these two trees, coupled with the new tree. 4) repeat 2) 3) until only a tree.
Date : 2025-12-17 Size : 1kb User : yy
[Other] contest DL : 0: 一次比赛的代码,有五道题,2,4比较基础,3题是模拟,1高精度,5树状dp-Once the game code, there are five questions, 2,4 basis of comparison, 3 title is the simulation, a high-precision, 5 tree dp
Date : 2025-12-17 Size : 697kb User : 刘龙飞
[Other] datastructure DL : 0: 建立二叉树的链式存储结构，在此基础上完成下列算法： 1）从键盘上输入二叉树的各个结点，建立二叉链表 2）输出该二叉树； 3）非递归的层次遍历序； 4）非递归的先序遍历、中序遍历、后序遍历；-The establishment of the chain store binary tree structure, based on this algorithm to accomplish the following: 1) input from the keyboard at all tree nodes, the establishment of binary list 2) the output of the binary tree 3) non-recursive traversal sequence level 4) non-recursive traversal of the first, in order traversal, after traversal
Date : 2025-12-17 Size : 90kb User : 王欣怡
[Other] graph_ DL : 0: //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)
Date : 2025-12-17 Size : 3kb User : atom
[Other] erchashu DL : 0: (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( ' \ n' ) for the importation of the end of signs, the importation of series L, to generate a binary sort tree T (2) of the binary sort tree traversal of T for the output results (3 ) Calculation of binary sort tree T to find the average successful search length, the output results (4) input element x, to find binary sort tree T, if the existence of the node containing x, then delete the node, and sequencing of times calendar (2 steps) Otherwise output " x does not exist" (5) input element x, to find binary sort tree T, if the tree does not exist整棵with a value of x nodes, then insert the node, and for medium-traversal (2 steps) Otherwise output " x already exists."
Date : 2025-12-17 Size : 1kb User : 涂舒
[Other] ds_baogao DL : 0: 哈夫曼编码与解码演示程序 1、从初始界面中给出的信息选择相应功能； 2、从终端读入字符集大小n，以及n个字符和n个权值。建立huffman树，并将它存于文件hfmtree.dat中 3、利用已经建好的huffman树对文件tobetran.dat中的正文进行编码，然后将结果存入文件codefile.dat中； 4、利用已经建好的huffman树将文件codefile.dat中的代码进行译码，结果存入文件textfile.dat中； 5、将文件codefile.dat以紧凑格式显示在终端上，每行50个； 6、将已在内存中的huffman树以直观的方式显示在终端上； -Huffman encoding and decoding demo 1, from the initial information given in the interface to select the appropriate function 2, read from the terminal character set size n, and n and n characters of the right values. Huffman tree establishment, and it is stored in documents hfmtree.dat in 3, has been built using huffman trees tobetran.dat the document is encoded in the body, and then the results into a document in codefile.dat 4, has been built using huffman tree will be a good document codefile.dat decoding of the code, the result into the document in textfile.dat 5, in order to compact the file format codefile.dat displayed on the terminal, 50 per line 6, will have huffman tree in memory intuitive way to show that in the terminal
Date : 2025-12-17 Size : 267kb User : 郑亮
[Other] tu3 DL : 0: 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
Date : 2025-12-17 Size : 2kb User : 王欣
[Other] erchashu DL : 0: 1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.
Date : 2025-12-17 Size : 1kb User : 王欣
[Other] haffman DL : 0: 一、需求分析问题描述：利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统能够对待传输数据预先编码，在接收端将传来的数据进行译码。对于双工信道（即可以双向传输信息的信道），每段都需要一个完整的编/译系统。试为这样的信息收发站写一个哈夫曼的编译码系统。基本要求：一个完整的系统应具有以下功能：（1） I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfm Tree中。（2） E:编码（Ecoding）。利用以建好的哈夫曼树，对文件tobetran中的正文进行编码，然后将结果存入文件codefile中。（3） D：译码（Decoding）。利用以建好的哈夫曼树将文件codefile中的代码进行译码，结果存入文件textfile中。（4） P：印代码文件（Print）。将文件codefile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件codeprin中。（5） T:印哈夫曼树（tree printing）。将已在内存中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件treeprint中。 -this programe is for student .it is at the 5.5
Date : 2025-12-17 Size : 2kb User : 王伟
[Other] FrameC_V0_4 DL : 0: 1. 这是对之前MyOOCFwV1_0(http://www.pudn.com/downloads229/sourcecode/middleware/detail1079540.html)的完善，解决了之前的bug 2. 新添源码(src目录下)：CharString、链式栈、链式队列、先序二叉树 3. 新添测试代码，放在test目录下 4. 运行环境：Linux + Eclipse IDE for C/C++ Developers-1. This is the improved version of the previous MyOOCFwV1_0(http://www.pudn.com/downloads229/sourcecode/middleware/detail1079540.html), having checked out and resolved some bugs 2. New source codes(under "src"): Char String, Linked Stack, Linked Queue, PreOrder Binary Tree 3. New codes for testing is under the directory of "test" 4. Enviroment: Linux+ Eclipse IDE for C/C++ Developers
Date : 2025-12-17 Size : 33kb User :
[Other] operation-shixi DL : 0: 实验二进程撤销模拟实验学时：2 实验类型：验证实验要求：必修一、实验目的 1) 理解进程撤销相关理论； 2) 掌握进程撤销流程。二、实验内容本实验针对操作系统中进程撤销相关理论进行实验。要求实验者设计一个程序，该程序可模拟撤销多个进程及其子孙进程。 1) 采用动态或静态方法生成一颗进程树（进程数目≥20）； 2) 设计进程撤销算法； 3) 实现进程撤销函数，采用级联方式撤销； 4) 可动态撤销进程； 5) 可动态观察进程树的情况； 6) 测试程序并得到正确结果。 -Second experiment the process of revocation of the simulation Experimental Hours: 2 Types of experiments: verification Experimental requirements: Required First, the purpose of the experiment 1) understand the process of revocation of the relevant theory 2) understand the process to withdraw the process. Second, experimental content In this study, the revocation of the operating system process theory to experiment. Requirements of the experimenter designed a program that can simulate the revocation of the multiple processes and their descendants process. 1) dynamic or static method to generate a tree of processes (process number ≥ 20) 2) The design process of revocation of the algorithm 3) the process of revocation of the function, the use of cascading revocation 4) can be dynamically revocation process 5) the dynamic observation of the process tree 6) The test procedure and get the correct results.
Date : 2025-12-17 Size : 38kb User : mengmeng
[Other] jinchengmoni DL : 0: 实验二进程撤销模拟实验学时：2 实验类型：验证实验要求：必修一、实验目的 1) 理解进程撤销相关理论； 2) 掌握进程撤销流程。二、实验内容本实验针对操作系统中进程撤销相关理论进行实验。要求实验者设计一个程序，该程序可模拟撤销多个进程及其子孙进程。 1) 采用动态或静态方法生成一颗进程树（进程数目≥20）； 2) 设计进程撤销算法； 3) 实现进程撤销函数，采用级联方式撤销； 4) 可动态撤销进程； 5) 可动态观察进程树的情况； 6) 测试程序并得到正确结果。 -Second experiment the process of revocation of the simulation Experimental Hours: 2 Types of experiments: verification Experimental requirements: Required First, the purpose of the experiment 1) understand the process of revocation of the relevant theory 2) understand the process to withdraw the process. Second, experimental content In this study, the revocation of the operating system process theory to experiment. Requirements of the experimenter designed a program that can simulate the revocation of the multiple processes and their descendants process. 1) dynamic or static method to generate a tree of processes (process number ≥ 20) 2) The design process of revocation of the algorithm 3) the process of revocation of the function, the use of cascading revocation 4) can be dynamically revocation process 5) the dynamic observation of the process tree 6) The test procedure and get the correct results.
Date : 2025-12-17 Size : 38kb User : mengmeng
[Other] BSTSort DL : 0: //本程序实现二叉排序树的基本操作： //1：输入数组长度和一串数，创建它的二叉排序树； //2：查找给定元素，并给出层次值； //3：插入给定元素； //4：先根和中根遍历； //5:显示菜单 //0：退出程序。-//This program is to achieve the basic operation of the binary sort tree:// 1: the length of the input array and a string of number, to create its binary sort tree // 2: Find a given element, and given the level value // 3: Insert the given element // 4: root and root traversal // 5: menu// 0: Exits the program.
Date : 2025-12-17 Size : 17kb User : 金比白
[Other] Balanced-binary-tree-operation-two DL : 0: 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括：（1）构造平衡二叉树；（2）输入数据；（3）对平衡二叉树的查找、插入、删除操作；（4）结束 -The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data (3) on the balanced binary tree search, insert, delete operations (4) the end of the
Date : 2025-12-17 Size : 2kb User : 张妍
[Other] erchashu DL : 0: 1. 请中序线索化一棵二叉树。 2. 写出先序、中序、后序遍历一棵中序线索二叉树的算法。 3. 请实现后序线索化一棵二叉树。 4. 编写测试程序。 -1 Please inorder threaded a binary tree. (2) write first order, in sequence, after traversing a binary tree algorithm in order clues. 3.Please clues to achieve a post-order binary tree. 4. Preparation of test procedures.
Date : 2025-12-17 Size : 2kb User : guan
[Other] shujujiegou DL : 0: 输入字符序列，建立二叉链表。（2）先序、中序、后序遍历二叉树:递归算法。（3）先序遍历二叉树:非递归算法（最好也能实现中序，后序非递归算法）。（4）求二叉树的叶子个数。（5）借助队列实现二叉树的层次遍历。　　　（6）在主函数中设计一个简单的菜单，分别调试上述算法。-Enter the character sequence to build the binary tree. (2) first order, in sequence, after the binary tree traversal: a recursive algorithm. (3) The first tree traversal: non-recursive algorithm (the best can achieve in sequence, after the non-recursive algorithm). (4) Find the number of leaves of the binary tree. (5) the level of aid queue binary tree traversal. (6) Design a simple menu in the main function, namely to debug these algorithms.
Date : 2025-12-17 Size : 1kb User : Hoang
[Other] avll DL : 0: （1）插入新结点（2）前序、中序、后序遍历二叉树（递归）（3）前序、中序、后序遍历的非递归算法（4）层次遍历二叉树（5）在二叉树中查找给定关键字(函数返回值为成功1,失败0) （6）交换各结点的左右子树（7）求二叉树的深度（8）叶子结点数（9）删除某结点-(1) Insert a new node (2) pre-order, in sequence, after the tree traversal (recursive) (3) pre-order, in sequence, after traversing a non-recursive algorithm (4) hierarchical tree traversal (5) in binary Find a given keyword (function returns a value of 1 on success, failure 0) (6) exchange about each node subtree (7) the depth of the binary tree (8) leaf nodes (9) delete a node
Date : 2025-12-17 Size : 4kb User : lkiliu
[Other] one DL : 0: 程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。 1.先序次序建立一个二叉树，用#表示某结点的左右子树是否为空，用于表示该结点是否为叶子或者可能存在左子树or右子树。例如对一个简单的三节点二叉树，节点b和c分别为根节点a的左孩子和右孩子，用先序来创建就表示为ab##c## 2.按先序、中序、后序、层次遍历分别输出二叉树的所有节点 3.求二叉树中所有节点数 4.求二叉树的深度 -Program binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure and the specific type of function definitions and the main function of each operation. 1 preorder order to create a binary tree, with the# indicates whether a node is about sub-tree is empty, indicating whether the node is a leaf or there may be left subtree or right subtree. For example for a simple three-node binary tree, the nodes b and c are the root of a left child and right child, with the first order to create it means is ab## c## 2. According to first order, in sequence after sequence, 3 Find all the nodes are output levels of the binary tree binary tree traversal of all nodes 4 binary tree of depth
Date : 2025-12-17 Size : 1kb User : 杨痒痒
[Other] 哎呀 DL : 0: 设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。（1）从文件中读入任意一篇英文短文（文件为ASCII编码，扩展名为txt）；（2）统计并输出不同字符在文章中出现的频率（空格、换行、标点等也按字符处理）；（3）根据字符频率构造哈夫曼树，并给出每个字符的哈夫曼编码；（4）图形化输出哈夫曼树、哈夫曼编码；（5）将文本文件利用哈夫曼树进行编码，存储成压缩文件（编码文件后缀名.huf）（6）用哈夫曼编码来存储文件，并和输入文本文件大小进行比较，计算文件压缩率；（7）进行译码，将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。(Design a Huffman coding and decoding system. Encoding the characters in an ascii - encoded text file, generating the encoding file; In turn, the encoded file decoding can be restored to a text file. ( 1 ) read any English short passage from the file ( the file is ascii and the extension is txt ); ( 2 ) statistics and output the frequency of different characters in the article ( space, line breaks, punctuation, etc. also by character ); ( 3 ) Huffman tree is constructed according to the character frequency, and Huffman coding of each character is given. ( 4 ) graphic output Huffman tree, Huffman coding; ( 5 ) the text file is encoded using Huffman tree and stored as compressed file ( encoded file suffix. huf ) ( 6 ) the Huffman coding is used to store the file, and compared with the input text file size, the compression ratio of the file is calculated. ( 7 ) decode, decode the huf file into ascii - encoded txt file, and compare it with the original txt file.)
Date : 2025-12-17 Size : 3kb User : 木七123

« 12 3 4 »