From ok@atlas.otago.ac.nz  Tue Dec  5 22:56:17 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 WAA07819
	for <prolog@swi.psy.uva.nl>; Tue, 5 Dec 2000 22:56:15 +0100 (MET)
Received: (from ok@localhost)
	by atlas.otago.ac.nz (8.9.3/8.9.3) id KAA11934;
	Wed, 6 Dec 2000 10:56:21 +1300 (NZDT)
Date: Wed, 6 Dec 2000 10:56:21 +1300 (NZDT)
From: "Richard A. O'Keefe" <ok@atlas.otago.ac.nz>
Message-Id: <200012052156.KAA11934@atlas.otago.ac.nz>
To: Lesta@t-online.de, ok@atlas.otago.ac.nz, prolog@swi.psy.uva.nl
Subject: Re: How to construct a tree from a given structure and elements

	> How is the order of a node's children to be determined?
	
	    There is no order of the children.
	   
No, the children of a tree represented by a Prolog term
cannot help but be in *some* order.  If the problem does not
specify a natural order, is there something about the processing
that suggests a natural order (perhaps ascending or descending
order of weight?), or would any arbitrary order suffice?

