[UVA][Math] 1264 - Binary Search Tree
A binary search tree is a binary tree. It may be empty. If it is not empty, it satisfies the following properties:
(1)Every node has a key, and no two nodes have the same key.
(2)The keys in a nonempty left subtree must be smaller than the key in the root of the subtree. ...
