Search - 2-3 tree

Search - 2-3 tree - List

[Software Engineering] HnSRTree-1.3.1.tar DL : 0: R 树，存取方式的当中最普遍的的用长方形，是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据，询问和操作众多的实验，我们能设计合并联合的优化的R* 树区域，各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较，它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形，R* 树的这优势举行为不同的型询问和操作，譬如地图覆盖物。为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸引力的由于以下二个原因1 它高效率地支持点和空间数据同时和2 它实施费用比那少许高级其它R 树。-R tree, which forms of access to the most common use of a rectangular shape, which is based on heuristic optimization rectangular inherent in all nodes running on a standardized test platform height data, inquiries and the operation of many experiments, we can design the optimal merging of the joint R* Tree region, judging from the various and overlapping rectangular marginal in the directory using our standardized test bed in a detailed performance comparisons, and it results R* tree clearly better than the existing R-tree deformation Guttman's linear and quadratic R-tree and R Green Tree deformation, R* Tree of this advantage at different type of inquiry and operation, such as maps cover. For two and multi-dimensional rectangular in all experiments from a practical point of R* tr
Date : 2026-01-03 Size : 168kb User : 王琪
[Software Engineering] 2-3-trees DL : 0: It s a note about data structure. Tree---self balancing and rotate-It's a note about data structure. Tree--- se lf balancing and rotate
Date : 2026-01-03 Size : 78kb User : Benny Van
[Software Engineering] shujujiegou-erchashu DL : 0: 叉排序树与平衡二叉排序树基本操作的实现用二叉链表作存储结构 (1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Date : 2026-01-03 Size : 2kb User : 胡图
[Software Engineering] shuxingshiyanjiegou DL : 0: 1)熟练掌握二叉树的二叉链表表示及前序创建算法与实现； 2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现； 3）掌握中序遍历线索二叉树的基本算法与实现 4）掌握中序遍历线索化二叉树的算法与实现 -1) The master of the binary tree list and the former express order to create algorithms and realize 2) proficiency in the first tree order, in sequence and post-order recursive traversal algorithm and realization 3) in order to master clues to the basic binary tree traversal algorithm and realization of 4) have a good clue of binary tree traversal algorithms and realize
Date : 2026-01-03 Size : 27kb User : huiyuanyuan
[Software Engineering] suanfuyouxiangkechengsheji DL : 0: （五）算符优先分析过程模拟【问题描述】设计一个给定算符优先分析表，输入一个句子，能由依据算符优先分析表输出与句子对应的语法树。能对语法树生成过程进行模拟。(算法参见教材) 【基本要求】动态模拟算法的基本功能是：（1）输入算符优先分析表和一个句子；（2）输出算符优先分析总控程序；（3）输出依据句子构对应的语法树的过程； -(V) priority analysis operator analog】【Description of the problem to design an analysis of a given operator priority table, type a sentence, can be analyzed from the basis of operator priority table output and the corresponding syntax tree sentence. Syntax tree can simulate the generation process. (See materials algorithm) the basic requirements of】【dynamic simulation algorithm for the basic functions are: (1) enter the Operator priority analysis form and a sentence (2) Analysis of the total output of the priority operator control procedures (3) sentence structure based on the corresponding output syntax tree of the process
Date : 2026-01-03 Size : 347kb User : cash
[Software Engineering] wangluogongchengkeshe DL : 0: 校园网络设计方案：1、要求设计理念先进，网络结构合理，满足实际的网络组建，并具有良好的可扩展性，适当为以后网络的升级做好准备。 2、保证某些重要楼宇的链路冗余，确保网络的稳定性。（可以适当扩展比如用生成树或者动态路由协议等来实现） 3、ip地址规划合理，既要满足实际网段的需要又不能浪费ip地址，并且尽可能的保证其连续性。 4、vlan划分既可以每楼层一个vlan又要考虑特殊情况（处于不同地域的同一个单位要同属于一个vlan） 5、保证多媒体等大流量情况下带宽的需求。（可以采用链路聚合）。 6、保证只有财务处的计算机才能连入财务的vlan。 7、能够根据用户行业特点和应用特点进行进行特性化设计 -Campus Network Design:1, required an advanced design concept, the network structure is reasonable, to meet the actual network formation, and has a good scalability for future network upgrade properly prepared. 2 to ensure that certain important buildings in the link redundancy to ensure network stability. (You can use an appropriate extension such as dynamic routing protocols such as Spanning Tree, or to achieve)3, ip address of the planning and reasonable, it is necessary to meet the needs of the actual network segment could not be a waste of ip address and as much as possible to ensure continuity. 4, vlan divided into either a vlan for each floor will have to consider special circumstances (the same one at different geographical units belong to the same vlan) 5, to ensure multi-media and other large bandwidth requirements of traffic conditions. (You can use link aggregation).6, ensure that only the Treasury can be connected to a computer financial vlan. 7, can be applied based on
Date : 2026-01-03 Size : 158kb User : 南宫斯诺
[Software Engineering] mobotix_sdk_1.0.1 DL : 0: Mobotix Ip camera SDK. CONTENTS I. WHAT IS THE MxPEG SDK C++ LIBRARY? I.1. OVERVIEW I.2. INTENDED AUDIENCE I.3. REQUIREMENTS I.4. AVAILABLE DISTRIBUTIONS I.5. LICENSING CONSIDERATIONS II. WHAT HAS CHANGED SINCE v0.9.1 III. COMPILATION III.1. A NOTE ON COMPONENTS III.2. BUILD SYSTEM SETUP III.3. SOURCE TREE DIRECTORY STRUCTURE III.4. COMPILATION ON WINDOWS AND UNDER MICROSOFT VISUAL C++ IV. SAMPLE APPLICATIONS IV.1. "mxgconv" - MxPEG STREAM CONVERTER IV.2. MxPEG Player - NO LONGER INCLUDED V. STATUS NOTES V.1. LIMITATIONS IN THIS RELEASE V.2. VERSION HISTORY-Mobotix Ip camera SDK. CONTENTS I. WHAT IS THE MxPEG SDK C++ LIBRARY? I.1. OVERVIEW I.2. INTENDED AUDIENCE I.3. REQUIREMENTS I.4. AVAILABLE DISTRIBUTIONS I.5. LICENSING CONSIDERATIONS II. WHAT HAS CHANGED SINCE v0.9.1 III. COMPILATION III.1. A NOTE ON COMPONENTS III.2. BUILD SYSTEM SETUP III.3. SOURCE TREE DIRECTORY STRUCTURE III.4. COMPILATION ON WINDOWS AND UNDER MICROSOFT VISUAL C++ IV. SAMPLE APPLICATIONS IV.1. "mxgconv" - MxPEG STREAM CONVERTER IV.2. MxPEG Player - NO LONGER INCLUDED V. STATUS NOTES V.1. LIMITATIONS IN THIS RELEASE V.2. VERSION HISTORY
Date : 2026-01-03 Size : 4.14mb User : allg
[Software Engineering] BinarySearchTree DL : 0: A binary search tree is a binary tree that is either empty or in which each node contains a key that satisfies the following conditions: 1) All keys (if any) in the left subtree of the root precede (are less than or equal to) the key of the root. 2) The key in the root precedes (is less than) all keys (if any) in its right subtree. 3) The left and right subtrees of the root are again binary search trees.
Date : 2026-01-03 Size : 65kb User : Rauahn
[Software Engineering] Linear-table-design DL : 0: 实验一是线性表的设计与实现程序；实验二是栈和队列的应用程序；实验三是树型结构的应用程序；-The first experiment, the linear table design and implementation of procedures experimental application of stacks and queues In Experiment 3, the tree structure of the application
Date : 2026-01-03 Size : 16kb User : JingxWang
[Software Engineering] 4 DL : 0: 编程任务：对于给定的树，以根结点为起点，对树实现非递归方式广度优先搜索，输出广度优先搜索序列  数据输入：由文件input.txt给出输入数据。第1行有1个正整数n，表示给定的二叉树有n个顶点，编号为1，2，…，n。接下来的n行中，每行有3个正整数a,b,c，分别表示编号为a的结点的左儿子结点编号为b，右儿子结点编号为c，0表示没有儿子。各结点信息按照层序列表的顺序给出。-Programming tasks: For a given of the tree, in order to root node as a starting point, right tree implementation non-recursive way of breadth-first search, the output breadth-first search sequence  Data Input: by the file input.txt given input data. First 1 Line There are 1 positive integer n, represents a given binary tree with n vertices, numbered 1,2, ..., n. The following n row, each line has three positive integers a, b, c, respectively indicate the reference numbers as a, node point of a left son of node point number is b, right-his son node point number as the c, 0 indicates no sons. Each of the balance point information in accordance with the layer sequence the order of tables are given.
Date : 2026-01-03 Size : 882kb User : miyor
[Software Engineering] android DL : 0: SourceForge.JP > 浏览软件 > Android 2.3 (Gingerbread) for SHARP IS01 >... GB_2.3_IS01 Android 2.3 (Gingerbread) for SHARP IS01 Summary Tree .
Date : 2026-01-03 Size : 8kb User : 蝇虽虽
[Software Engineering] shiyan3 DL : 0: 对四则运算表达式的抽象语法树进行后序遍历，可以得到输入表达式所对应的四元式序列（实验4要用到这样的四元式序列）。例如输入1+2*(3+4)，对应的抽象语法树的中序遍历序列、四元式序列分别为-After the abstract syntax tree arithmetic expressions were preorder, you can get input expression quaternion corresponding sequence (Experiment 4 to use this quaternion sequence). For example, enter 1+2* (3+4), the traversal sequence corresponding abstract syntax tree quaternion sequences were
Date : 2026-01-03 Size : 1kb User : 汪祥
[Software Engineering] elght DL : 0: Master different methods to find, and can be used to achieve high-level language search algorithm. 2, master and orderly sequence table lookup method tables. 3, master binary sort tree structure, search, insert, and delete methods
Date : 2026-01-03 Size : 2kb User : 流火学倩
[Software Engineering] 1 DL : 0: 对记录序列（查找表）：{55，13，23，72，109，67，2，78,13}分别实现如下操作： 1) 顺序查找； 3) 对排好序的纪录序列表进行折半查找； 4) 利用1）中记录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找； 5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表； 6) 实现5）创建哈希表上的查找 -On the record sequence (lookup table): {} 55,13,23,72,109,67,2,78,13 were achieved as follows: 1) sequential search 3) sorted record sequence table binary search 4) Using 1) the establishment of a recorded sequence binary sort tree, and to achieve specific keywords to find the value of the node on which 5) Create a hash table of length m = 11 in accordance with the method of conflict management "in addition to leaving the remainder" linear probing hash constructor and re-hash 6) achieve 5) create a hash table lookup on
Date : 2026-01-03 Size : 8kb User : 潘珍
[Software Engineering] SimpleTree1.3 DL : 0: tree menu , left menu-tree menu , left menu
Date : 2026-01-03 Size : 43kb User : 蔡喜明
[Software Engineering] 16 DL : 0: 进销存管理系统（1）登录系统，首先进入系统登录页面。（2）登录系统后，可通过首页中树状菜单进行相关操作，在树状导航菜单提供了基础信息管理、库存管理、商品销售、查询统计、往来管理、系统设置几个功能。（3）通过点击树状导航菜单中的“基础信息管理”可实现“客户信息管理”、“商品信息管理”、“供应商信息管理”、“商品信息查询”等内容。（4）树状导航菜单中提供的二级标题中都包含有3级标题内容，来满足用户的需要。使用SQLServer2005+MyEclipse+Tomcat实现-Inventory management system- (1) log into the system, first enter the system login page. (2) login system, can be performed by home-related operations in the tree menu in the tree navigation menu provides basic information management, inventory management, merchandise sales, query statistics, demand management, system settings several functions. (3) the tree navigation menu by clicking the " basic information management" to achieve " customer information management," " product information management," " Supplier Information Management" , " commodity information query" and so on. (4) The tree provides secondary navigation menu headings are included 3 title content to meet the needs of users. Use SQLServer2005+MyEclipse+Tomcat achieve
Date : 2026-01-03 Size : 3.22mb User : 宇文恩
[Software Engineering] BTree DL : 0: B-Tree of order 4 Each node has at most 4 pointers and 3 keys, and at least 2 pointers and 1 key. Insert: 5, 3, 21, 9, 1, 13, 2, 7, 10, 12, 4, 8 Delete: 2, 21, 10, 3, 4
Date : 2026-01-03 Size : 9kb User : rahul
[Software Engineering] Image-Stitching DL : 0: 基于SIFT特征的全景图像拼接主要分为以下几个步骤： (1) 读入两张图片并分别提取SIFT特征 (2) 利用k-d tree和BBF算法进行特征匹配查找 (3) 利用RANSAC算法筛选匹配点并计算变换矩阵 (3) 图像融合 -Image Stitching
Date : 2026-01-03 Size : 13kb User : 白玉