Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

当我没问:)

Posted by LiHaoyuan at 2005-07-10 16:43:57 on Problem 2477
In Reply To:a binary search tree inductively as follows: Posted by:xiedi at 2005-07-10 16:43:01 
> 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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator