From Lesta@t-online.de  Tue Dec  5 09:17:36 2000
Received: from mailout05.sul.t-online.com (mailout05.sul.t-online.com [194.25.134.82])
	by swi.psy.uva.nl (8.9.3/8.9.3) with ESMTP id JAA13072
	for <prolog@swi.psy.uva.nl>; Tue, 5 Dec 2000 09:17:36 +0100 (MET)
Received: from fwd04.sul.t-online.com 
	by mailout05.sul.t-online.com with smtp 
	id 143DIH-0004pK-07; Tue, 05 Dec 2000 09:17:45 +0100
Received: from t-online.de (05121269112-0001@[62.226.21.117]) by fwd04.sul.t-online.com
	with esmtp id 143DIE-0f0lFIC; Tue, 5 Dec 2000 09:17:42 +0100
Message-ID: <3A2CA481.D0570235@t-online.de>
Date: Tue, 05 Dec 2000 09:17:05 +0100
From: Lesta@t-online.de (Uwe Lesta)
Organization: Lesta
X-Mailer: Mozilla 4.7 [de]C-DT  (WinNT; I)
X-Accept-Language: de,en
MIME-Version: 1.0
To: "Richard A. O'Keefe" <ok@atlas.otago.ac.nz>,
        swi prolog mailing list <prolog@swi.psy.uva.nl>
Subject: Re: How to construct a tree from a given structure and elements
References: <200012042224.LAA04782@atlas.otago.ac.nz>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Sender: 05121269112-0001@t-dialin.net



"Richard A. O'Keefe" schrieb:
> 
> Uwe Lesta asked:
>         What is the best way to write a program that build a balanced tree
>         from this facts ?
> 
> What *kind* of balanced tree?
> Height balanced?  Weight balanced?

    Weight balanced.
	
> How is the order of a node's children to be determined?

    There is no order of the children.
   

-- 


Regards

Uwe
Lesta@t-online.de

