Search - 2-3 tree

Search - 2-3 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 : 2026-01-03 Size : 93kb User : 赵文明
[Other] 3二叉树 DL : 0: 这是一个用可以解决二叉树先序，中序，后序排列的程序-This is a binary tree can be solved with first sequence, sequence after sequence with procedures
Date : 2026-01-03 Size : 1kb 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 : 2026-01-03 Size : 1kb User : yy
[Other] yematreeforAll2.0.3 DL : 0: 这个是关于树的代码，可以帮助那些初学者学习参考-This is about the tree code, you can help those who are beginners to learn the reference
Date : 2026-01-03 Size : 13kb User :
[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 : 2026-01-03 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 : 2026-01-03 Size : 90kb User : 王欣怡
[Other] 3 DL : 0: 掌握与文件和目录树有关的系统调用和库函数。-Master files and the directory tree related system calls and library functions.
Date : 2026-01-03 Size : 10kb User : Yejianmei
[Other] hafu DL : 0: 华南师范大学计机实验3,哈夫曼树,不含实验报告-South China Normal University of experiment 3, Huffman tree, the report does not contain experiments
Date : 2026-01-03 Size : 3kb User : 许志勇
[Other] tree DL : 0: 多元树的层次遍历、先根遍历、后根遍历问题的描述：函数填空：层次遍历多元树（在文件tree.cpp中3个空）、先根遍历、后根遍历的递归函数（在文件tree.h中2个空）；多元树的输入：在主程序中调用多元树的函数（定位根、找大儿子、找下一个兄弟等），输入某棵多元树。 -Multi-level tree traversal, the first traversal the root, root traversal issues Description: function to fill in the blank: multi-level tree traversal (tree.cpp in the document in three space), the first traversal the root, root ergodic recursive function (in the document in two empty tree.h) multiple input tree: In the main program to call multi-tree function (positioning root, look for the eldest son, to find a brother, etc.), enter a multi-tree tree.
Date : 2026-01-03 Size : 3kb User : YY
[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 : 2026-01-03 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 : 2026-01-03 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 : 2026-01-03 Size : 267kb User : 郑亮
[Other] pretree DL : 0: 采用C语言编写的先序遍历二叉树的源程序，该程序有3部分构成：主程序，构造树函数，先序遍历函数-Written in C language using the first order binary tree traversal of the source, the program has three parts: the main program, construct a tree function, preorder traversal function
Date : 2026-01-03 Size : 1kb User : keke
[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 : 2026-01-03 Size : 2kb User : 张妍
[Other] tree DL : 0: Write有效的功能，它接受一个指向二叉树的根T和计算：一个。（1）T的叶子的数量（2）含有一个非NULL子T中的节点数目湾（3）he含有两个非空的儿童T中的节点数量-Write effective function, which accepts a pointer to the root of the binary tree T and computing: a. (1) the number of T leaves (2) contains a non-NULL number of nodes in the node number of sub-T Bay (3) he has two non-empty children in T
Date : 2026-01-03 Size : 1kb User : 林宥嘉
[Other] tree DL : 0: 编写一个算法程序实现： 1、建立一棵6个结点的二叉树，结点的数据值是正整数，并按中序输出之； 2、完成对以上二叉树中所有结点的左、右子树相互交换，并按中序输出交换以后的结果。 3、统计二叉树叶子结点的个数，并输出结果。 -Write an algorithm Program: 1. Establish a tree node 6 binary data value node is a positive integer, the output of the press in order 2, complete binary tree above all nodes in the left and right subtree mutual exchange, according to the exchange after the results of the output sequence. 3, the number of binary tree leaf node statistics, and outputs the result.
Date : 2026-01-03 Size : 1kb User : ding
[Other] 3 DL : 0: 实现数据结构，二叉树的代码-Achieve data structure, the code of the two fork tree
Date : 2026-01-03 Size : 1kb User : 罗英雄
[Other] 3 DL : 0: 遍历算法、二叉树、先序中虚后续递归遍历非递归便利-binary tree
Date : 2026-01-03 Size : 2kb User : zhoujin
[Other] BST DL : 0: 问题描述利用二叉查找树（BST）实现一个动态查找表。基本要求 (1) 使用二叉树（BST）来实现。 (2) 二叉树使用链式结构（二叉链表）实现。 (3) 实现BST的构建，查找两个功能。 -The basic requirements(1) using a binary tree (BST).(2) binary tree using the chain structure (binary list).(3) implementation of BST build, find two functions.
Date : 2026-01-03 Size : 1kb User : 程悦
[Other] Chapter_2.1.1.3 DL : 0: 贝叶斯算法、决策树、神经网络等算法的简单python实现(Bias algorithm, decision tree and neural network)
Date : 2026-01-03 Size : 4kb User : 格罗斯

« 12 3 4 5 6 »