文件名称:Implementing-BSTs
- 所属分类：
- JSP源码/Java
- 资源属性：
- [Java] [源码]
- 上传时间：
- 2013-11-10
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- to***
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
An important special kind of binary tree is the binary search tree (BST). In a BST, each node stores some information including a unique key value and perhaps some associated data. A binary tree is a BST iff, for every node n, in the tree:
All keys in n s left subtree are less than the key in n, and
all keys in n s right subtree are greater than the key in n.
All keys in n s left subtree are less than the key in n, and
all keys in n s right subtree are greater than the key in n.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Implementing BSTs.java