Search - 2-3 tree

Search - 2-3 tree - List

[Other] 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 -------------------------------------------------------------------------------- -Perl
Date : 2026-01-03 Size : 644kb User : David Yin
[Other] C++dexuexikejian DL : 0: 概论：程序设计的基本概念与基本 1 . 方法；怎样才能学好这门基础课 2. 程序的基本结构 3. 编程关键：逻辑思维与问题求解人是怎样让计算机帮助自己解题的 4. 数据的组织方式一：数组 5. 模块化：函数与函数调用 6. 分治思想：递归算法及其实现 7. 逻辑指代与物理指代：指针 8. 数据的组织方式二：结构 9. 蒙特卡洛法 10.贪心法 11.动态规划 12. 数据的组织方式三：链表与树 13.数据的组织方式四：文件，数据的永久存储与重复使用 14.面向对象程序设计的概念及特点-Introduction: the basic concepts of program design and basic one. Methods how to learn this basic course 2. The basic structure of the procedure 3. Programming key: logical thinking and problem solving is how to make computers help themselves solve problems 4. Data one organization: the array 5. Modularized: function and function call 6. divided Thought: recursive algorithm and its realization 7. logical and physical anaphora anaphora: pointer 8. data organization II: the structure of 9. montecalvo Lofa 10. Greedy 11. Dynamic Programming 12. data organization III: List and Tree 13. data organized in a manner that four: documents, data, permanent storage and re-use 14. object-oriented programming concepts and the characteristics of
Date : 2026-01-03 Size : 1.88mb User : wenyong
[Other] FreeBSD_develepment_manual DL : 0: 目录第1章　介绍第2章　编程工具第3章　安全的编程第4章　本地化与国际化 - L10N 和 I18N 第5章　源代码树指南和维护发展策略第6章　回归与性能测试 -Contents Chapter 1 Introduction Chapter 2 Programming Tools Chapter 3 Security Programming Chapter 4 localization and internationalization- L10N and I18N Chapter 5 of the source code tree and strategy Chapter 6 regression and performance testing
Date : 2026-01-03 Size : 53kb User : charles
[Other] CPCNA-640-80-2-2.95 DL : 0: Complete coverage of all four CCNP exams: ? EIGRP, OSPF, IS-IS, and BGP ? Optimizing routing ? IP multicast ? IPv6 ? VLAN implementation ? Spanning Tree ? InterVLAN routing ? Layer 3 redundancy ? Wireless LANs ? VoIP in campus networks ? Campus network security ? Frame-mode MPLS ? IPsec ? Cisco device hardening ? Cisco IOS? threat defenses ? Cisco VoIP ? QoS and AutoQoS ? Wireless scalability
Date : 2026-01-03 Size : 4.83mb User : Pankaj Joshi
[Other] DataCommunicationNetwork DL : 0: 数据通信网络 1 概述， OSI 7层结构 2 数据链路层，帧，差错检测 3 重传算法 4 重传算法 5 排队模型-概述和Little定理 6 M/M/1, M/M/m, 队列，等 7 排队网络 8 M/G/1队列, M/G/1 w/ 空闲 9 M/G/1 队列和保留, 优先队列 10 排队系统的稳定性 11 M/G/1队列占用率分布 12 测验 13 多路访问和Aloha 14 稳定的Aloha，树算法 15 CSMA, CSMA/CD和以太网 16 高速LANs，令牌环网，Satellite reservations 17 交换结构概述 18 高速交换调度 19 广播路由和生成树 20 最短路径路由 21 分布式路由算法，最佳路由 22 流量控制-窗口/方案 23 流量控制-基于速率的方案 24 运输层和TCP/IP 25 ATM网络 26 特别专题：光网络和无线网络-Data Communication Network An overview, OSI 7-layer structure of two data link layer, frames, error detection 3 Retransmission Retransmission Algorithm 4 Algorithm 5 queuing model- Overview and Little Theorem 6 M/M/1, M/M/m, queues, and so on 7 8 M/G/1 queue, queuing networks, M/G/1 w/free 9 M/G/1 queue, and reservations, priority queue 10, queuing system, the stability of the 11 M/G/1 queue, the distribution of the occupancy rate of 12 tests over 13 Road access and Aloha 14 stable Aloha, tree algorithm 15 CSMA, CSMA/CD and 16 high-speed Ethernet LANs, token ring network, Satellite reservations 17 switching architecture overview of 18 high-speed switch scheduling 19 broadcast routing and shortest path spanning tree 20 Route 21 Distributed routing algorithm, the best route 22 traffic control- windows/programs, 23 traffic control- rate-based program of 24 transport layer and the TCP/IP 25 ATM network of 26 Special topic: optical networking and wireless networks
Date : 2026-01-03 Size : 4.8mb User : 孙琛
[Other] Graphtheory DL : 0: 图论的算法书籍，书中包含许多经典的例子，入门用。章节：1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性-Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the
Date : 2026-01-03 Size : 4.1mb User : wlx
[Other] 2 DL : 0: 3．设有n个学生，每个学生包含学号、姓名、分数三部分数据，其中学号是关键字，依次输入这些学生数据来建立一棵二叉排序树，然后再输入一个学号进行查找，查找成功则输出该学生的数据；查找失败输出找不到信息。-3. With n students, each student with Student ID, name, score three parts of the data, including Student ID is the keyword, followed by these students enter the data to create a binary sort tree, and then enter a Student ID to find, Find the success of the output of the student' s data lookup failed output can not find the information.
Date : 2026-01-03 Size : 1kb User : 徐晟喆
[Other] CCNA6 DL : 0: 　路由协议有在阻止层3的循环的过程.但是假如在你的switches间有冗余的物理连接,路由协议并不能阻止层2循环的发生,这就必须依靠生成树协议(Spanning Tree Protocol,STP)-Routing protocols are Layer 3 in stop cycle process. But if your switches in a redundant physical connection between the routing protocol does not prevent the occurrence of layer 2 loop, which must rely on spanning tree protocol (Spanning Tree Protocol, STP )
Date : 2026-01-03 Size : 234kb User : rocky
[Other] class_presentation DL : 0: 是一种多路搜索树（并不是二叉的）： 1.定义任意非叶子结点最多只有M个儿子；且M>2； 2.根结点的儿子数为[2, M]； 3.除根结点以外的非叶子结点的儿子数为[M/2, M]； -Is a multi-way search tree (not binary in): 1. The definition of any non-leaf node at most M son and M> 2 2. The son of the root node number [2, M] 3 . Except root node, other than the son of non-leaf node number [M/2, M]
Date : 2026-01-03 Size : 58kb User : korbon
[Other] sy DL : 0: 1栈和队列2线性表3图4树5删除重复结点6查找和排序-3 Figure 4 tree 5 1 stack and queue 2 linear table delete duplicate node 6 Find and Sort
Date : 2026-01-03 Size : 2.99mb User : 薛科文
[Other] zTreeAPI-v2.6 DL : 0: 　zTree 是一个依靠 jQuery 实现的多功能 “树插件”，支持静态和Ajax异步加载节点数据，让你拥有强大的树控菜单，但有些朋友并不是下载ZTree后都会用的，zTree API使用手册是官方网站提供的，可能版本稍早，新版本的手机官网上还没有提供下载，如果想看新版的API，可以去教程内指定的官方网站，在此提供的zTree API使用手册是2.6版的，介绍了zTree API的核心函数、参数说明、方法、事件、常量等，喜欢zTree的就请下载吧。-zTree is a rely on jQuery to achieve multi-purpose tree plug support static and Ajax asynchronous Loading node data, so you have a powerful tree control menu, but will use some friends not download ZTree, zTree API User' s Guide is the official website, possible versions earlier, the new version of the phone official website has not yet available for download, if you want to see the new version of the API specified in the tutorial, you can go to the official website, the this zTree API user manual version 2.6 introduced the the zTree API core function, parameter descriptions, methods, events, constants, like zTree the download.
Date : 2026-01-03 Size : 112kb User : 陈国富
[Other] avl-2.1.3.tar DL : 0: AVL tree handling class for Python
Date : 2026-01-03 Size : 74kb User : Zgembo Adislic
[Other] 06005593 DL : 0: In this paper, we propose a novel medical registration approach based on minimal spanning tree. The proposed approach has the following contributions. (1) Compared with single type of feature points, we extracted corner-like and edge-like points from image, and added a few random points to cover the low contrast regions. (2) Instead of fixing the multi-feature points in the whole procedure, they are hierarchically updated at different registration stages. (3) Based on the feature points, in addition to using pixel intensity, we also added region based feature to include more spatial information. The proposed method is evaluated by performing registration experiments on BrainWeb. The experimental results show that the proposed method achieves better robustness while maintaining good registration accuracy, compared to the conventional normalized mutual information (NMI) based registration method
Date : 2026-01-03 Size : 248kb User : Salkoum