搜索资源列表
Binarysearchtree
- 实现二叉搜索树的一些基本操作，如查找、删除等-Some of the basic operations of the binary search tree, such as search, delete, etc.
tree
- 给定一个序列，按照顺序输入，构建一颗二叉搜索树。本实验为数据结构必做实验，仅提供cpp文件，读者可在编译器上自行编译实现。-Given a sequence of inputs in the order to build a binary search tree. In this study, the data structure must do the experiment, only cpp file, the reader can compiler to compile your own
tree_batch_mode
- 开发语言：C 开发环境：CCStudio_v3.3 功能：二叉搜索树（BST）的插入和转换功能-Contains the functionality of Binary Search Tree (BST) insertion and traversels.
ConvertBinarySearchTree
- 该C++源码可将二叉搜索树转换为一个已排序的双向链表。-Convert a BinarySearchTree to a sorted double linkedlist.
binurary-tree
- 一个建立二叉搜索树的简单小程序，供初学者参考一下-A binary search tree created a simple applet
CAvlTree
- VB基于二叉平衡搜索树实现的汉字转拼音源程序-VB based on balanced binary search tree implementation of Chinese pinyin source
pst_src
- 该示例实现基于pst的Planar Point Location的slab算法。在slab算法的基础上，将每个slab上的搜索树对应于一个version, 而相邻两个slab之间的搜索树的差异较少，可以尽可能多的重用已有结构达到节约空间使用的目的。 -The sample-based pst of Planar Point Location of slab algorithms. Algorithm based on the slab, the slab on each search tr
OptimalBinarySearchTree
- vs2010实现的OBST算法，最优二叉搜索树 实现功能： 1、文件读取，手动输入，数据更新。 2、p/q表数据保留，便于手动添、删或修改 3、最优解的二叉树结构显示 文件读取示例文档在压缩包内-vs2010 achieve OBST algorithm, optimal binary search tree implementation functions: 1, file read, manually entered data updates. 2, p/q table
6_isBSTree
- 判定一棵二叉树（以二叉链表结构存储）是否是一棵二叉搜索树。-Determining a binary (binary tree structure in memory) whether it is a binary search tree.
BST
- 用动态规划解答最优二叉查找树问题，最优二叉搜索树-Using dynamic programming solution optimal binary search tree problem with Optimal binary search tree
tree
- 对二叉搜索树的C#实现，有增，搜，删的功能-Binary search tree of the C# to achieve, there are increasing found, delete function
zuiyouerfenjiansuozhu
- 最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。-Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming met
BinarySearchTree
- 这个文件提供的C++代码实现的二叉搜索树。这是一种高效的数据结构。非常有参考价值-This file provides the implementation of c++ code of binary search trees. This is a highly efficient data structure. There is reference value
Binary_Tree
- 数算的二叉树的POJ作业，分别有：二叉树1_二叉树的操作；二叉树2_文本二叉树；二叉树3_由中根序列和后根序列重建二叉树；二叉树4_表达式.表达式树.表达式求值；二叉树5_Huffman编码树；二叉树6_二叉搜索树；二叉树7_实现堆结构-Count of the binary tree POJ jobs
BST
- POJ 二叉搜索树 嘻嘻嘻 做的时候是一遍过好开心-POJ Hee hee hee binary search tree to do it again when it is too good fun ~ ~
AVLTree
- AVL 树是平衡二叉搜索树，所以首先 必须满足搜索树，即l_child值<parent值<=r_child值。这个在前面已经实现了。插入和删除不停的递归就可以。-Two AVL tree is balanced binary search trees, so we must first meet the search tree, l_child value and <parent value of <=r_child value. The in front has bee
xiansuoerchashu
- 该代码是描述而叉搜索树的建立和排序，方便大家来学习！-The code is described and binary search tree establishment and sorting, to facilitate everyone to learn!
2013.10.26_BST
- 生成一颗二叉平衡搜索树，随着输入与删除，同步更新树的结构，使之保持平衡。-Generate a balanced binary search tree, with the input and deleted, synchronized tree structure to keep it balanced.
Binary-Search-Tree-Code
- 二叉搜索树的详细算法的过程，是算法分析里较为重要的一个算法-Process detailed binary search tree algorithm, the algorithm analysis is more important in an algorithm
2011010963_e4
- THUEE数据与算法实验四： 1、二叉树的所有结点的关键字由文件输入，其中关键字均为一个整数，构造增强二叉搜索树，并统计树的层高，按要求把结果输出到文件中。 2、给定两个增强二叉搜索树P和T，判断从形状上（不考虑结点关键字值）P是否等于T的某个子树，即T是否包含P。（最好对于任意形式二叉树均可实现比较，不仅限于二叉搜索树）-THUEE four experimental data and algorithms: a keyword all nodes by binary file inp