文件名称:BinarySearchTree
介绍说明－－下载内容均来自于网络，请自行研究使用
A binary search tree is a binary tree that is either
empty or in which each node contains a key that
satisfies the following conditions:
1) All keys (if any) in the left subtree of the root
precede (are less than or equal to) the key of the
root.
2) The key in the root precedes (is less than) all keys
(if any) in its right subtree.
3) The left and right subtrees of the root are again
binary search trees.
empty or in which each node contains a key that
satisfies the following conditions:
1) All keys (if any) in the left subtree of the root
precede (are less than or equal to) the key of the
root.
2) The key in the root precedes (is less than) all keys
(if any) in its right subtree.
3) The left and right subtrees of the root are again
binary search trees.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
31.Binary Search Tree.pdf