搜索资源列表
BST
- binary search tree in c-binary search tree in c++
tree
- 实现二叉树的建立，节点的插入，删除，和搜索功能。并在main函数中实现各种功能。-To achieve the establishment of a binary tree, node insertion, deletion, and search functions. In the main function to achieve various functions.
bst.c
- binary search tree( add, delete, search,traversal ..)
gouzaoshuyi
- 利用数组结构创建一棵词汇树，里面存储了大量图片的信息，通过搜索树的思想来检索图片-Create a tree structure using arrays vocabulary, large tree search tree by the letter pictures of thought to retrieve images
tree
- 二叉树的生成和查找，平且中序遍历生成顺序的数组-Binary tree generation and search
BinaryTree
- c++数据结构中的二分查找树，是比较基本的数据查找结构，查找效率比较高-c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient
Alphabeta_HH
- Alpha-Beta搜索算法，博弈树搜索中最常用的算法之一-Alpha-Beta search algorithm, the game tree search, one of the most commonly used algorithms
Binarysearchtreedeshixian
- 1．掌握二叉搜索树的基本概念。 2．掌握二叉搜索树基本操作的实现。 -1. Binary search tree to master the basic concepts. 2. To master the basic operation of binary search tree implementation.
DataStructure
- 二叉查找树数据结构及基本操作，前序遍历，中序遍历，以及其非递归算法-Binary search tree data structure and basic operation, pre-order traversal, inorder traversal, as well as its non-recursive algorithm
Binary-tree-search
- 这是一个有关二叉树查找类，总的来说比较好用-This is a binary tree to find the class, are generally more easy to use
TireTree
- Trie树,又称字典树、单词查找树,是一种树形结构，用于保存大量的字符串。它的优点是：利用字符串的公共前缀来节约存储空间，是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use
tree
- 平衡二叉树：插入结点 在平衡二叉排序树BBST上插入一个新数据元素e 删除结点 删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。 查找 把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。 -Insertion node in the balanced binary sort tree BBST insert a new data element e remov
B_S_T
- This is an implementation of Binary search tree.
main
- binary search tree.vcproj -binary search tree.vcprojbinary search tree.vcproj
BSTTree
- binary search tree for ds by c++ .
shiyanbaogao
- 动态查找表的设计与实现,实现抽象数据类型：二叉查找树。实现下列操作:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素. -Dynamic look-up table of the design and implementation to achieve the abstract data types: binary search tree. To achieve the following: construct an empty table, des
tree
- 功能全面的二叉查找树与红黑树的性能比较算法，可以输出树的外形，并且支持用户自定义调整。-Full-featured binary search trees and red-black tree performance comparison algorithm can output the tree shape, and supports user-defined adjustments.
bst.cpp.tar
- this a binary search tree implementation including insert, find, delete etc. functions.-this is a binary search tree implementation including insert, find, delete etc. functions.
binarysearchtree
- binary search tree Thanks
binarysearchtree
- 二叉查找树的各种函数 包括初始化 插入 删除 各种遍历-Binary search tree insertion deletion of various functions, including initialization of various traversal