 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
a binary search tree inductively as follows:In Reply To:难道是我的题目意思理解错了? Posted by:LiHaoyuan at 2005-07-10 16:26:46 The empty tree which has no node at all is a binary search tree Each non-empty binary search tree has a root, which is a node labelled with an integer, and two binary search trees as left and right subtree of the root A left subtree contains no node with a label >= than the label of the root A right subtree contains no node with a label <= than the label of the root Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
