搜索资源列表
xiaoxingyinghancidian
- 问题描述：设计一个英汉词典，支持Member的查找、插入、删除操作。 基本要求：实现字典的常用方法有：有序线性表（用二分检索实现）、AVL树（二叉搜索树）、Patricia Tree、散列表等，任选一种方法实现字典的操作，查找单词、插入单词（插入时，先查找，找不到插入，找到提示用户）、删除单词（删除时，先查找，找到删除，找不到提示用户）。字典是按字母顺序排列的，不能用顺序查找，插入或删除单词后，要保持字典的有序性。 测试数据：任一英文单词。 提高要求：选用两种以上的方法实现字典的操作
Binary-search-tree
- 一个二叉搜索树的程序，包含二叉搜索树的插入、删除、查找等基本操作-A binary search tree program, including the binary search tree insert, delete, find the basic operations s
data-struct
- 一些数据结构算法集合：普通链表结点、双向循环链表结点、二叉树结点、 树结点、双向循环链表、哈希表、二叉搜索树等。-A collection of some data structure algorithms: ordinary linked list of nodes, two-way circular linked list of nodes, the binary tree node, tree node, two-way circular linked lists, hash tables
BinarySearchTree
- 按键盘输入顺序，二叉搜索树的建立，前序，中序，后序周游算法。链式存储。-Keyboard input order, the establishment of the binary search tree, preorder, inorder and postorder travel around the algorithm. Chain store.
MFC-BST
- MFC编程实现二叉搜索树，包括查找，插入，删除和旋转。-MFC programming for binary search tree, including find, insert, delete, and rotate.
TreeToList
- 将二叉搜索树变为双向链表，先序遍历输入节点，输出双向链表-The binary search tree into a doubly linked list, doubly linked list of the preorder traversal of the input node, output
BStreeLJH
- MFC实现二叉搜索树，输出先序，中序和后序遍历结果。-MFC binary search tree, output preorder, inorder and postorder traversal results.
EX3
- 链表实现的普通二叉搜索树，支持插入、搜索、删除功能。-Linked list implementation ordinary binary search tree, support insert, search, delete function.
SearchTree
- 二叉搜索树，实现二叉搜索树的插入、删除、查找、周游功能-Binary search tree, binary search tree insert, delete, find, traveling function
BinaryTree
- 基本的二叉搜索树的算法 初始化 插入元素 删除元素-The basic binary search tree algorithm initialization insert elements to remove elements
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
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