Search - 2-3-4 tree

Search - 2-3-4 tree - List

[Other resource] xyshopv1.3free DL : 0: 主要特色功能如下： 1．注册与否均可购物（同类程序中大多要求注册才能购物），方便了那些懒得注册的客户。降低门槛，自然能抓住更多潜在商机。 2．除了同类程序中常见的左侧分类树外，还有顶端分类。左侧分类和顶端分类均可在后台方便的进行管理，左侧分类可任意排序。 3．首页通过“新品速递”和“热销商品”两个栏目来展示商品，可自行设置在首页显示的商品的数量，产品介绍页面中还会推荐点击率最高的商品。 4．产品支持略图、全图、大图、多图，非常适合从多角度拍摄商品图片，对商品进行全方位的展示。-main features are as follows : 1. Shopping can be registered or not (a similar procedure can be registered mostly shopping), the convenience of those who bother to register customers. Lower the threshold, more natural can seize potential business opportunities. 2. Similar procedures in addition to the left side of common classification tree, there is the top classification. Left classification and the top classification in the background can facilitate the management, the left can be arbitrary classification ranking. 3. Page through "new Express" and "hot-selling commodity" two columns to the display of goods would be free to set up in the Home show volume of goods, products introduced pages will recommend the highest hit rates of commodities. 4. Product Support sketch,
Date : 2008-10-13 Size : 800.5kb User : 刘元凯
[Other resource] hymnnews DL : 0: HYMN文章管理系统v1.0（后台程序）系统介绍： 1，新闻采用在线编辑器（本人改进版），从别的网页copy过来，连接和图片、falsh等可以完整保留 2，可web上传图片，小音频，视频信息或flash到服务器，直接添加到文章中 3，大部分逻辑处理都封装在java-bean，界面修改容易 4，栏目分类采用树形编码方式，无限制级别 5，完善的权限管理方式，可为每个用户自定义后台权限-HYMN article Management System v1.0 (background process) system introduced : one, using online news editor (I improved version), from the other website copy up connections and pictures, stuff that can complete two reservations, web upload pictures, audio small, as or flash frequency information to the server, directly added to article 3, the most logical processing package, the java-bean, interface easy modification four columns using classification tree encoding, unlimited-5, improve the competence of management, for each user-defined background competence
Date : 2008-10-13 Size : 697.11kb User : 肖洋
[Other resource] 8数码A算法 DL : 0: 设计说明：1。数据结构和表示：程序用1、2、3、4分别表示将右、上、左、下的数字块移动到空格之中。采用典型的树+链表结构，每种局面产生一个BoardState类。出于避免走法顺序列表被过多复制的考虑，在树结构中保存局面的继承关系。每种新的局面产生后，引用估值函数产生f的值，再根据大小将其插入链表之中，以便实现“优先展开f值小的节点”。Solve()函数在成功解决问题之后保存一个走法序列供输出并返回零，而失败则返回失败处的节点层数。(具体的判断方法见后文)-Design Notes : 1. Data structure and said : 1,2,3,4 procedures used were said to the right, and left, The figure moved to the block among the blanks. A typical tree Chain structure, each have a situation BoardState category. For France order to avoid excessive copying the list was, in consideration of the tree structure to preserve the situation in relation to the succession. Each of the new situation after the election, have cited valuation function f value, in accordance with the size of its insertion Chain, in order to achieve the "priority start small f value of the node." Solve () function in the successful solution of the problem after a law to preserve sequence for output and return to zero. and failure to return to the failed node floors. (Specific judgment method, see be
Date : 2008-10-13 Size : 13.28kb User : 陈士骞
[Other resource] loadcode DL : 0: 在MATLAB中编写实现图像的不同级别小波分解算法；2选择合适的小波基；3对经典的几幅黑白和彩色图像进行DWT变换；4实现零树、基于塔式网格矢量量化、基于LBG算法、基于标量量化等小波变换编码；5得到分析比较结果。达到的目的：1综合训练学生编程的能力；2对高数、计算方法、程序设计、数据结构、算法、数字图像处理等课程的复习和运用；3可培养学生的算法设计和分析能力。-in MATLAB prepared to achieve different levels of image wavelet decomposition algorithm; Choice of two small Porgy; Three pairs of classic pieces of black-and-white and color images DWT; Four zero tree, grid-based Tower vector quantization, LBG-based algorithm, based on the scalar quantization Wavelet Transform Coding ; 5 analyzed the results of the comparison. The purpose : a comprehensive training program students; Two pairs of the high number and the method of computation, programming, data structures, algorithms, digital image processing and review of the curriculum used; Three students can develop the algorithm design and analysis.
Date : 2008-10-13 Size : 33.91kb User : aa
[Other resource] huffmancode111 DL : 0: huffman完整源代码C语言实现，有本人超级详细解释（看不懂你去跳楼吧）算法设计: 1、对给定的n个权值{W1,W2,W3,...,Wi,...,Wn}构成n棵二叉树的初始集合F={T1,T2,T3,...,Ti,...,Tn}，其中每棵二叉树Ti中只有一个权值为Wi的根结点，它的左右子树均为空。（为方便在计算机上实现算法，一般还要求以Ti的权值Wi的升序排列。） 2、在F中选取两棵根结点权值最小的树作为新构造的二叉树的左右子树，新二叉树的根结点的权值为其左右子树的根结点的权值之和。 3、从F中删除这两棵树，并把这棵新的二叉树同样以升序排列加入到集合F中。 4、重复二和三两步，直到集合F中只有一棵二叉树为止。 -Huffman complete C source code language, I have super-detailed explanation (you do not understand it jumped) algorithm design : one, the right to the right values n (W1, W2, W3 ,..., Wi ,..., Wn) n trees constitute the binary tree initial pool F = (T1, T2, T3, ... Ti ,..., Tn), which is indeed a binary tree Ti only a right to the value of Wi Root. it's about subtrees are empty. (For the convenience of the computer algorithm, the general also demanded the right to Ti Wi value of ascending.) 2. in 1984 two F Root weights smallest tree as a new structure of the binary tree around subtrees, new Binary Tree Root in the right value for their son around the tree Root and the right value. 3, F deleted from this two trees, and how the new binary tree in the same ascending into the pool F. 4, re
Date : 2008-10-13 Size : 11.62kb User : 乐乐
[Other resource] Visual_C++_500_Samples DL : 0: Visual.C++编程技巧精选500例随书附盘第1章消息框 1.消息框设置演示第2章常用控件 13.如何使用picturebox 控件浏览多种格式的图像？ 12.如何使listcontrol控件支持整栏选择？ 11.如何在列表框中自动装载磁盘文件列表？ 10.如何显示载有richedit 控件的对话框？ 9.如何限制编辑控件输入的字符类型？ 8.如何在程序窗口中创建按钮控件？ 7.按钮设置演示 6.如何使用滚动条控件？ 5.如何使用进度条控件？ 4.如何使用列表控件？ 3.如何使用树形控件？ 2.如何使用标签控件？ 1.如何使用滑块控件？第3章通用对话框 8.如何在程序启动时弹出文件打开对话框？ 7.如何在文件对话框中预览位图文件？ 6.文件对话框文件夹操作演示 5.文件对话框使用演示 4.如何使用查找与替换对话框？ 3.如何使用页面设置对话框？ 2.如何使用颜色对话框？ 1.如何使用字体对话框？第4章标题栏与菜单栏 26.如何在子菜单中记录历史文件？ 25.如何确定顶层菜单所占的行数？ 24.如何取消对菜单状态的限制？ 23.如何取消应用程序菜单栏？ 22.如何获取菜单栏高度？ 21.如何在对话框类型的应用程序中加载菜单？ 20.如何设计自定义快捷菜单？ 19.如何创建一个弹出式菜单？ 18.如何触发一个菜-Visual.C programming skills selected 500 cases with Disks Chapter 1 of a news box. Speech news box set Chapter 2 of said common control 13. how to use the picturebox control View Multi-Format Image? 12. How listcontrol Control supportive of the whole column choice? 11. How the list box automatically loading disk document lists? 10. How to show contains dialog richedit controls? 9. How to restrict the importation of editorial control character type? 8. How to create window control buttons? 7. Button to display six. How to use the scroll controls? 5. How to use the progress of control? 4. How to use control list? 3. How to use tree controls? 2. How to use the label control? 1. How to use slider controls? Chapter 3 common dialog 8. How commencement of the proceedings while the document open d
Date : 2008-10-13 Size : 21.63mb User : lueying
[Other resource] Weka-3-2 DL : 0: Weka is a collection of machine learning algorithms for data mining tasks. The algorithms can either be applied directly to a dataset or called from your own Java code. Weka contains tools for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also well-suited for developing new machine learning schemes. 一个可以实现多种方法分类的软件，利用各个对象的属性。决策树，距离、密度等-Weka is a collection of machine learning al gorithms for data mining tasks. The algorithms can either be applied directly to a dataset or ca lled from your own Java code. Weka contains tool 's for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also well-suited for d eveloping new machine learning schemes. can be a real Categories are various methods of software, using all the attributes of objects. Decision Tree, distance, density, etc.
Date : 2008-10-13 Size : 14.73mb User : 马何坛
[Other resource] dwtwav DL : 0: ual-Tree Complex Wavelet Transform Pack - version 4.3 Nick Kingsbury, Cambridge University, June 2003. This pack (version 4.2) includes the following functions for performing the Dual Tree Complex wavelet Transform on 1-D and 2-D signals-ual-Tree Complex Wavelet Transform Pack - Nick Kingsbury version 4.3. Cambridge University, health systems. This pack (version 4.2) includes the following functions for performing the Dual Tr ee Complex wavelet Transform on 1-D and 2-D sign als
Date : 2008-10-13 Size : 73.03kb User : 王僮
[Other resource] pxml DL : 0: Perl & XML. by Erik T. Ray and Jason McIntosh ISBN 0-596-00205-X First Edition, published April 2002. (See the catalog page for this book.) Table of Contents Copyright Page Preface Chapter 1: Perl and XML Chapter 2: An XML Recap Chapter 3: XML Basics: Reading and Writing Chapter 4: Event Streams Chapter 5: SAX Chapter 6: Tree Processing Chapter 7: DOM Chapter 8: Beyond Trees: XPath, XSLT, and More Chapter 9: RSS, SOAP, and Other XML Applications Chapter 10: Coding Strategies Index Colophon --------------------------------------------------------------------------------
Date : 2008-10-13 Size : 644.44kb User : David Yin
[Other resource] 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 : 2008-10-13 Size : 78.13kb User : Benny Van
[Other resource] 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 : 2008-10-13 Size : 1.98kb User : 胡图
[Other resource] SJJG_BIT DL : 0: 常用数据结构演示：1、链表管理；2、二叉树；3、背包问题；4、力的实现；5、表达式计算；6、分水问题。-commonly used data structures exercise : 1, Chain management; 2, the binary tree; 3, knapsack problem; 4, the force achieved; 5. formulas; 6, the dividing issues.
Date : 2008-10-13 Size : 571.98kb User : 林健
[Other resource] SortTree DL : 0: 创建一棵二叉排序树，并采用中序遍历和层次遍历法输出其顶点序列，主要实验内容如下： 1. 定义二叉排序树的结构BiTree； 2. 编制二叉排序树的插入算法：void Insert_SortTree (BiTree ST, ElemType x)； 3. 编制中序遍历函数； 4. 在main()函数中完成二叉排序树的建立，以及中序遍历的输出。（二叉排序树的各个元素从键盘输入，并利用Insert_SortTree()函数进行插入建立）； 5. 编制层次遍历函数，并在main()函数中完成层次遍历的输出。层次遍历法要利用“队列”来实现；为此需要定义一个队列结构（可以采用链队列，也可以采用循环顺序队列），并实现相关的队列函数。 -create a binary sort tree, and used the preorder and output levels traversal sequence its peak, the main contents are as follows : 1. Sort definition of two fork BiTree tree structure; 2. Ranking compiled binary tree insertion algorithm : void Insert_SortTree (BiTree ST ElemType x); 3. establishment preorder function; 4. in the main () function to complete binary tree in order to establish, and the Central preorder output. (2 forks ranking tree various elements from the keyboard input, and the use of Insert_SortTree () function to insert the establishment); 5. Traversing the preparation level functions, and the main () function to complete traverse the output level. Level traversal to using "queue" to achieve; This requires definition of a cohort structure (Queue chain can be use
Date : 2008-10-13 Size : 14.89kb User : 段苛苛
[Other resource] tree DL : 0: 表达式类型的实现: 1、一个表达式和一颗二叉树之间，存在着自然的对应关系。 2、假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。（1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。（2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。（3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。（4） Value(E)——对算术表达式E求值。（5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。
Date : 2008-10-13 Size : 20.97kb User : 刘丹华
[Other resource] Huffman DL : 0: 迄今为止见过的最方便的huffman编码，效率很高一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set the value of each node to the number of times that its symbol appears in the data stream. 3) Create a Minimum-Heap of N nodes. 4) Add every node whose value is greater than zero to the heap. 5) Extract the best two nodes in the heap. 6) Create a parent node whose children are the two extracted nodes. 7) Add the parent node to the heap. 8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap). 9) Extract the last node in the heap. The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream. The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Date : 2008-10-13 Size : 17.37kb User : 游弋人生
[Other resource] BST BBT DL : 0: 数据结构大型作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!" / "NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Date : 2008-10-13 Size : 3.94kb User : 洪玲叶
[Other resource] 树的问题（生成） DL : 0: ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、先序遍历、中序遍历：性能分析：O( n )(1) 若遇到新节点非空则先入栈，然后访问其左子树。(2) 若为空则将栈顶结点出栈，访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是：先序在入栈时访问节点，中序在出栈时访问节点。3、层遍历：性能分析：O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点有左孩子，则左孩子入队；有右孩子，则右孩子入队。(4) 重复2、3直到队列为空。4、线索树：算法与先序遍历、中序遍历一样，只是将访问节点的Visit函数改为连接前驱与后继的操作。性能分析：O( -BinaryTree ADT Implementation and certification procedures used in the main data structure : binary tree, stack, algorithms team thinking : a first order contribution, the output tree, after preorder using recursive method. Performance Analysis : O (n) 2, preorder, the preorder : Performance Analysis : O (n) (1) If there is a new non-empty nodes were first pushed and then left to visit their son tree. (2) if the empty Zhanding node will stack up, visit their right subtrees. (3) 1,2 cycle until the stack is empty with no node can be pushed. First sequence with the sequence difference : Push the first sequence to visit nodes, which stack up in order to visit nodes. 3, the layer traverse : Performance Analysis : O (n) (1) nodes into Force (2) nodes and the team's visit (3) if the nodes ar
Date : 2008-10-13 Size : 2.2kb User : 徐欣
[Other resource] bptree DL : 0: 清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value / means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
Date : 2008-10-13 Size : 3.69kb User : qqiang
[Other resource] x040330007 DL : 0: 系统介绍： 1，新闻采用在线编辑器（本人改进版），从别的网页copy过来，连接和图片、falsh等可以完整保留 2，可web上传图片，小音频，视频信息或flash到服务器，直接添加到文章中 3，大部分逻辑处理都封装在java-bean，界面修改容易 4，栏目分类采用树形编码方式，无限制级别 5，完善的权限管理方式，可为每个用户自定义后台权限-system introduced : one, using online news editor (I improved version), from the other website copy up connections and pictures, stuff that can complete two reservations, web upload pictures and small audio, video or flash information to the server, directly added to article 3 Most of the logic processing package, the java-bean, interface easy modification four columns using classification tree encoding, unlimited-5, improve the competence of management, for each user-defined background competence
Date : 2008-10-13 Size : 695.8kb User : wq
[Other resource] Weka-3-2 DL : 0: Weka is a collection of machine learning algorithms for data mining tasks. The algorithms can either be applied directly to a dataset or called from your own Java code. Weka contains tools for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also well-suited for developing new machine learning schemes. 一个可以实现多种方法分类的软件，利用各个对象的属性。决策树，距离、密度等-Weka is a collection of machine learning al gorithms for data mining tasks. The algorithms can either be applied directly to a dataset or ca lled from your own Java code. Weka contains tool 's for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also well-suited for d eveloping new machine learning schemes. can be a real Categories are various methods of software, using all the attributes of objects. Decision Tree, distance, density, etc.
Date : 2025-12-16 Size : 14.73mb User : 马何坛

« 12 »