搜索资源列表
search-tree
- 中文三叉树字典（Ternary Tree），可以用于分词，自动提示，查询速率与Hash Table相当,支持动态添加。-Chinese trigeminal tree dictionary (Ternary Tree), can be used for word, auto tips, check rates and Hash Table equivalent support for dynamically added.
BinSrchTree
- 最优二分检索树的算法实现，有图形化界面MFC编程-Optimal binary search tree algorithm, a graphical interface MFC Programming
Search-Tree
- C语言编写，二叉查找树的非递归实现。包含一个描述二叉树的头文件和实现功能的cpp文件。-Non-recursive implementation of binary search tree, written in C++. Contains a header file of the binary tree of the header files and source file of functions.
Binary-search-tree
- 一个二叉搜索树的程序，包含二叉搜索树的插入、删除、查找等基本操作-A binary search tree program, including the binary search tree insert, delete, find the basic operations s
search-tree
- C语言实现搜索树的搜索、插入与删除功能源代码-C language implementation of the search tree search, insert, and delete function source code
binary-search-tree
- binary search tree definisi dan penjelasan binary search tr-binary search tree definisi dan penjelasan binary search tree
binary-search-tree
- 二叉树代码，（查找，插入，删除，左右子树交换）-binary search tree. Create a menu in which you can insert, delete, find elements, find the depth and swap left and right child tree.
Implement-a-binary-search-tree-for-string
- Implement a binary search tree for string
AVL-Tree
- AVL tree - is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one
Binary-Search-Tree-Code
- 二叉搜索树的详细算法的过程，是算法分析里较为重要的一个算法-Process detailed binary search tree algorithm, the algorithm analysis is more important in an algorithm
binary-search-tree-algorithm
- 二叉查找树的简单算法实现，包括增删查找等功能-the algorithm of binary search tree
Optimal-binary-search-tree-algorithm
- 最优二叉搜索树算法，Optimal binary search tree algorithm-Optimal binary search tree algorithm
binary-search-tree-judgment
- 算法实现了对任一二叉树的判断，判断其是否是二叉搜索树，代码简洁优化，附有说明文档。-Algorithm for either binary judgment, determine whether it is a binary search tree, concise code optimization, annotated document.
BINARY-SEARCH-TREE.cpp
- 二叉搜索树在动态查表中有特别的用处，一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列，构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点，在进行插入操作时，不必移动其它结点，只需改动某个结点的指针，由空变为非空即可。 这里，我们想探究二叉树的建立和序列输出。-Binary search tree has a dynamic look-up table in particular the usefulness of an unordered
Binary Search Tree
- This is a binary search tree program. it can be related to the student for studying data structure.
Two-insert-search-tree
- 包含查找最大值、最小值的二叉搜索树方法，程序简洁明了-Binary search tree method comprising find the maximum, minimum, clear and concise program
binary-search-tree
- Binary search tree with the ability to remove - add - search - print
Complete-Binary-Search-Tree
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-04-树6 Complete Binary Search Tree 编译器：python2-Complete Binary Search Tree A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled left to ri
Binary-Search-Tree
- 实现了二叉查找树的各种操作：插入结点、构造二叉树、删除结点、查找、 查找最大值、查找最小值、查找指定结点的前驱和后继-Achieve a binary search tree of various operations: Insert node binary tree structure, delete nodes, find, find maximum, find minimum, look for the specified node predecessor and successor
Binary-Search-Tree
- binary search tree functions