On Sun, Sep 19, 2004 at 11:02:44PM -0500, Brian Hurt wrote:
> The code is actually fairly easy.  Take the length of the list.  Subtract 
> one for the root node.  The first (n-1)/2 elements are in the left hand 
> subtree, the last n-1-((n-1)/2) elements are in the right subtree.

Wouldn't you have to iterate over the list when implementing this?
What I mean to say is that this would work if you had a pre-sorted
Array, but not a linked List.  ?

Rich.

-- 
Richard Jones. http://www.annexia.org/ http://www.j-london.com/
Merjis Ltd. http://www.merjis.com/ - improving website return on investment
http://www.winwinsales.co.uk/ - CRM improvement consultancy