Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming Platform: |
Size: 2048 |
Author:记忆超 |
Hits:
Description: 这是一个检索URL的算法，该算法通过调用拉宾指纹算法为URL库中的每个URL生成一个32位的指纹。来一个URL时，检索URL库，通过拉宾指纹算法来判别是否存在，时间为O（1），还使用了二叉检索树来存储URL。主程序为RabintestDisk.java。
-This is a URL retrieval algorithm by calling Rabin fingerprint algorithm for the URL database for each URL to generate a 32-bit fingerprint. To a URL, the URL retrieval library, through the Rabin fingerprinting algorithm to determine whether there is time for the O (1), also used the binary search tree to store the URL. Main program for RabintestDisk.java. Platform: |
Size: 9216 |
Author:陈方然 |
Hits:
Description: <算法导论>第二版大部分算法实现.
1. 各类排序和顺序统计学相关
2. 数据结构
2.1 基本数据结构
2.2 散列表
2.3 二叉查找树
2.4 红黑树
2.5 数据结构基于红黑树的扩张
3. 高级涉及和分析技术
3.1 动态规划相关
3.2 贪心算法相关
3.3 用于不相交集合的数据结构
4. 部分图算法.-<Introduction to Algorithms> Algorithms realize most of the second edition of .1. All kinds of sorting and order statistics related to 2. Data Structure 2.1 Basic Data Structure 2.2 Hash Table 2.3 Binary search Tree 2.5 Tree 2.4 red and black red and black tree-based data structure the expansion of 3. High and analytical techniques involving dynamic programming related 3.1 Greedy Algorithm 3.2 for the relevant 3.3 Disjoint Set Data Structure 4. part of Fig algorithm. Platform: |
Size: 324608 |
Author:QJGui |
Hits:
Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search Platform: |
Size: 77824 |
Author:俞昊旻 |
Hits:
Description: Binary Search:算法基础，用于快速查找，是树算法的基石-Binary Search:Algorithm, used to quick find, tree algorithm s foundation Platform: |
Size: 2048 |
Author:荆江 |
Hits:
Description: 用java写的二叉搜索树的小例子，初学者看的代码-Written with java binary search tree small example, look at the code for beginners Platform: |
Size: 2048 |
Author:徐锦来 |
Hits:
Description: Java数据结构第五课：二叉树的实现。本程序实现了二叉树的查找，删除，插入，转主链，恢复，二叉树保存等。-Java Data Structure Lesson: binary tree implementation. This program implements a binary tree search, delete, insert, turn the main chain, recovery, binary tree preservation. Platform: |
Size: 33792 |
Author:蒙长江 |
Hits:
Description: java实现的二叉查找树，只有一个类··没有main函数··测试绝对通过··自己用了很多次-java implementation of binary search tree, only one class of absolutely no main function of the test many times through their use Platform: |
Size: 1024 |
Author:tom |
Hits:
Description: Data Structures in java which helps us to describe the data structures like linked list,hash dictionary,avl teel,binary search tree,array list and all util package Platform: |
Size: 18810880 |
Author:noopur |
Hits:
Description: 高度平衡性检查
给定一个整数树，检查它是否高度平衡，返回一个布尔值。
搜索树属性的测试
给定一个整数树，写一个方法，返回一个布尔值，表示是否是一个二进制搜索树。
高度平衡插入
为二进制搜索树编写修改版本的插入方法，以便它保持树的高度平衡性。你应该假定输入树是高度平衡的，并产生一个高度平衡的树。
该方法应在（日志）时间内工作。
你可以使用issearchtree和isheightbalanced方法Assert语句来验证您的代码是正确的。
高度平衡删除
为二进制搜索树（在工作表1中所做）的删除方法编写一个修改版本，以便保持树的高度平衡性。你应该假定输入树是高度平衡的，并产生一个高度平衡的树。
该方法应在（日志）时间内工作。-Checking for height-balanced property
Given a tree of integers a, check to see if it is height-balanced, returning a boolean value.
Test for the search tree property
Given a tree of integers a, write a method that returns a boolean value indicating whether a is a binary search tree.
Insertion with height-balancing
Write modified version of the insert method for binary search trees so that it maintains the height- balanced property of trees. You should assume that the input tree is height-balanced and produce a height-balanced tree again.
The method should work in O(log n) time.
You may use the isSearchTree and isHeightBalanced methods in assert statements to verify that your code works correctly.
Deletion with height-balancing
Write a modified version of the delete method for binary search trees (done in Worksheet 1) so that it maintains the height-balanced property of trees. You should assume that the input tree is height-balanced and produce a height-balanced tree Platform: |
Size: 5120 |
Author:Teresa Wang |
Hits:
Description: Binary Search Tree Java based demonstration on Canvas using AJAX for communication between browser and server
Platform: |
Size: 59392 |
Author:Saurabh Raj |
Hits:
Search - java binary search tree