From ok@atlas.otago.ac.nz  Mon Dec  4 23:24:47 2000
Received: from atlas.otago.ac.nz (atlas.otago.ac.nz [139.80.32.250])
	by swi.psy.uva.nl (8.9.3/8.9.3) with ESMTP id XAA06885
	for <prolog@swi.psy.uva.nl>; Mon, 4 Dec 2000 23:24:41 +0100 (MET)
Received: (from ok@localhost)
	by atlas.otago.ac.nz (8.9.3/8.9.3) id LAA04782;
	Tue, 5 Dec 2000 11:24:40 +1300 (NZDT)
Date: Tue, 5 Dec 2000 11:24:40 +1300 (NZDT)
From: "Richard A. O'Keefe" <ok@atlas.otago.ac.nz>
Message-Id: <200012042224.LAA04782@atlas.otago.ac.nz>
To: Lesta@t-online.de, prolog@swi.psy.uva.nl
Subject: Re:  How to construct a tree from a given structure and elements

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?
How is the order of a node's children to be determined?

