Search - 2-3 tree

Search - 2-3 tree - List

[Console] shujujiegou DL : 0: 1.实现顺序表的基本操作，包括顺序表的初始化、第i个元素前插入一个新的元素、删除第i个元素、查找某元素、顺序表的销毁。2.实现单链表、循环链表、双向链表的所有基本操作 3.定义顺序栈类型，实现栈的所有基本操作。定义链栈类型，实现栈的所有基本操作。应用栈实现数制的转换。4.定义顺序队列类型，实现栈的所有基本操作。定义链队列类型，实现栈的所有基本操作。将字符串转换为整形。5.定义二叉链表类型，建立二叉树。先序、中序、后序、层次遍历二叉树，并输出遍历结果。-1. Achieve the basic operation of the sequence table, including the initialization sequence table prior to insert a new element in the i-th element, delete the i-th element, find an element, the destruction of the sequence table. Single linked list, circular linked list, doubly linked list of all basic operations. Define the order of the stack type, stack all the basic operations. The definition of the type of chain stack, all the basic operations of the stack. The application stack to achieve the number system conversion. 4 defined order queue type stack all the basic operations. Defined the chain queue type, and all the basic operations of the stack. To convert a string of plastic surgery. 5. Defined the binary list type, the establishment of a binary tree. The first sequence, sequence after sequence, levels of the binary tree traversal and output loop through the results.
Date : 2026-01-03 Size : 10kb User : ludan
[Console] HuffmanTree DL : 0: 哈夫曼编/译码器利用哈夫曼编码进行信道通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统系统对待传数据预先编码，在接收端将传来的数据进行译码(复原)。对于双工信道(即可以双向传输信息的信道)，每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼码的编/译码系统。要求：一个完整的系统应具有以下功能： (1)初始化(Initialization)。从终端读入字符集大小n，以及n个字符和权值, 建立哈夫曼树，并将它存于文件hfmTree中。 (2)编码(Encoding)。利用已建好的哈夫曼树(如不在内存，则从文件hfmTree中读入)对文件ToBeTrans中的正文进行编码，然后将结果存入文件CodeFile中。 (3)译码(Decoding)。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。- Huffman encoder/decoder The use of Huffman coding channel communication can greatly improve the channel utilization, time-to-information transmission, and reduce transmission costs. However, this requires the sending end through a coding system pre-treatment data encoding, decoding at the receiving end of the data (recovery). For duplex channel (ie two-way transmission channel), each side needs a complete encoder/decoder system. Write a Huffman encoder/decoder system test for such information transceiver station. Requirements: a complete system should have the following features: (1) initialization (Initialization). Read from the terminal character set size n, and n characters and weights, Create a Huffman tree, and save it in a file hfmTree. (2) encoding (encoding). Huffman tree has been built (if not in memory, read from the file hfmTree Into) the file ToBeTrans the text encoding, and the result is stored in the file CodeFile. (3) decoding
Date : 2026-01-03 Size : 248kb User : 丁洁琼
[Console] binary-tree DL : 0: （1）输入字符序列，建立二叉链表。（2）先序、中序、后序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法。（最好也能实现先序、后序非递归算法）（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）借助队列实现二叉树的层次遍历。（7）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence to build binary list. (2) first order, in sequence, after the binary tree traversal: recursive algorithm. (3) traversal of a binary tree: non-recursive algorithm. (Preferably also able to achieve the first sequence, after the non-recursive algorithm) (4) binary tree of height. (5) the number of tree leaves. (6) With the level of a binary tree traversal queue. (7) in the main function to design a simple menu, respectively debugging the above algorithm.
Date : 2026-01-03 Size : 2kb User : fei
[Console] SortaSearch DL : 0: 3种简单排序及堆排序、shell排序、快速排序、归并排序。二查搜索树的建立、遍历及插入、删除结点-Three kinds of simple sorting and heap sort, shell sort, quick sort, merge sort. Two investigations to establish the search tree traversal and insert, delete nodes
Date : 2026-01-03 Size : 3kb User : 赵启明
[Console] HuaffmanTree DL : 0: 数据结构哈夫曼编/译码器功能： 1.初始化：输入一串字符（正文），计算不同字符 (包括空格)的数目以及每种字符出现的频率(以该种字符出现的次数作为其出现频率），根据权值建立哈夫曼树，输出每一种字符的哈夫曼编码。 2.编码：利用求出的哈夫曼编码，对该正文（字符串）进行编码，并输出。 3.译码：对于得到的一串编码，利用已求得的哈夫曼编码进行译码，将译出的正文输出。输出哈夫曼树形态：以树的形式输出哈夫曼树。-Data structure Huffman encoding/decoding Function: 1. Initialization: input a string of characters (the body), calculate the number of distinct characters, including Spaces) as well as the frequency of each character (in the number of occurrences of this kind of character as its frequency), according to the weight to build the Huffman tree, output each kind of Huffman encoding of the characters. 2. Coding: the calculated Huffman encoding, to encode the text (string), and output. 3. Decoding: to get a bunch of code, using Huffman coding has been obtained to decode, to translate the text output. Output: Huffman tree form output in the form of tree Huffman tree.
Date : 2026-01-03 Size : 704kb User : 屈兴
[Console] 2-3-tree-master DL : 0: 2—3树的建立，插入，删除，清空等功能的实现-Establish a 2-3 tree, insert, delete
Date : 2026-01-03 Size : 3kb User : 赵
[Console] Family_tree DL : 0: 高级语言程序设计实验3，使用二叉树建立家族族谱，实现创建家谱，添加家族成员，查询成员的双亲、兄弟姐妹及祖先的第几代等功能，编译环境VS 2010-High-level language programming experiment 3, the use of a binary tree to establish the family genealogy, genealogy achieve create, add family members, parents, members of the inquiry, siblings and the first generations of ancestors and other functions
Date : 2026-01-03 Size : 4.95mb User : 赵正亮