搜索资源列表
BST
- 二岔搜索树 可完成基本操作 遍历 查找 删除 判断两树是否相等
wordcount
- 利用将词表存入BST树然后对词频进行统计，统计词表中词语出现次数。
BST
- 利用c++实现BST树功能，及前叙、中续、后续遍历-Use c++ Achieve BST tree functionality, and the former Syrian, in the continued follow-up traversal
AVLTree
- AVL树的实现，其中包括BST树的建立以及平衡函数-AVL tree realize, including the BST tree set up and strike a balance between function and so on
Bst
- 我们的结课作业。二叉排序树的各种操作，以及二叉排序树的绘制。MFC框架编程，界面友好-Results of our class work. Binary Sort Tree various operations, and the binary sort tree drawing
BST
- 强悍BST，可以实现BST树的大部分功能，比如查找，插入，删除，-Powerful BST
bst
- 排序二叉树类简单实现，采用引用类型代码很简洁，但是很巧妙。-btree code
bst-remove
- 筛选排序二叉树中的数据，分别有>,<=,以及两者之间的函数-Filter data sorted binary tree, respectively,> , < =, and the difference between the function
BST
- 二叉树实例代码：用于初学二叉树的学习代码，很好理解-Binary tree instance code: learning code, good for beginner binary tree understand
bst
- 实现了二叉查找树的各种功能, 如查找\删除\插入等,结构比较清晰-The various functions of the binary search tree, such as Find \ delete \ insertion, the structure is relatively clear
binary_tree
- 二叉树的建立和遍历，包含非递归。源码中自己定义栈和队列，没有用到stl。还有AVL，BST，线索二叉树，还有堆。自己看吧-something about binary tree
BST
- BS树的，创建，插入，删除查找功能inorder排序-For question 2, I give the program a list of number which is: 15 45 878 96 253 451 12. At the end of number will be 0 to tell the program the input is end. There is a menu we can chose to insert, delete and find element
Chap06
- 数据结构中的树相关的算法和源代码，包括AVL树、BST树和优先队列等，自己用VC6.0编写的。-Tree data structure algorithms and related source code, including AVL tree, BST trees and priority queues, etc., own VC6.0 prepared.
bst
- 二叉树实现，含遍历，codeblocks调试，C++代码-Binary Tree, including traversal, codeblocks debugging, C++ code
BST
- 二叉搜索树，使用c++开发语言实现，开发平台为visual studio 2012-search tree， use c++
BST
- 问题描述 利用二叉查找树（BST）实现一个动态查找表。 基本要求 (1) 使用二叉树（BST）来实现。 (2) 二叉树使用链式结构（二叉链表）实现。 (3) 实现BST的构建，查找两个功能。 -The basic requirements(1) using a binary tree (BST).(2) binary tree using the chain structure (binary list).(3) implementation of BST buil
BST
- 使用BST树建立一个城市数据库，可实现插入、删除等操作(Building a city database using the BST tree)
BST二叉树的基本操作
- BST二叉排序树的插入、查询、删除、遍历 （中序遍历 从小到大）(The basic operation of the BST two forked tree.Inserting, querying, deleting, traversing two forked sort trees.)
BST
- 二叉树的实现，还有测试，学生自打，请多关照(The realization of two forked tree)
二叉查找树(Ⅰ)-创建和遍历
- input It is composed of multiple sets of data. Each group of data is composed of two lines. The first line is the number of keywords to be inserted, n (1<=n<=100). The second line is a positive integer separated by a n space, with a value o