From vaithan@hotmail.com Wed Nov 21 03:36:22 2001
Received: from hotmail.com (f103.law12.hotmail.com [64.4.19.103])
	by swi.psy.uva.nl (8.10.2+Sun/8.11.2) with ESMTP id fAL2aLf16507
	for <prolog@swi.psy.uva.nl>; Wed, 21 Nov 2001 03:36:21 +0100 (MET)
Received: from mail pickup service by hotmail.com with Microsoft SMTPSVC;
	 Tue, 20 Nov 2001 18:36:20 -0800
Received: from 172.129.62.160 by lw12fd.law12.hotmail.msn.com with HTTP;
	Wed, 21 Nov 2001 02:36:20 GMT
X-Originating-IP: [172.129.62.160]
From: "Vaithan Param" <vaithan@hotmail.com>
To: ok@atlas.otago.ac.nz, prolog@swi.psy.uva.nl
Subject: Re: [SWIPL] HELP : IMPLEMENTATION
Date: Wed, 21 Nov 2001 02:36:20 +0000
Mime-Version: 1.0
Content-Type: text/plain; format=flowed
Message-ID: <F103VvLVKi3s1wsXZZT00018598@hotmail.com>
X-OriginalArrivalTime: 21 Nov 2001 02:36:20.0903 (UTC) FILETIME=[4DE8F370:01C17235]


Thanks A LOT.

I was able to figure out the rest except the allbutlast and allbutmaybelast 
which got me a bit confused, but I understand now thanks to you.

Anywayz I got a new problem. I know I am pushing my luck, but Prolog is one 
language I get all confused in.

sorted(T,L) if L is a list of the nodes in binary search tree T and L is
sorted in increasing order.Define sorted(T,L) - it is to return L when given 
T.


I have no idea how to go about it and what the query will look like.



Thanks A LOTT Again,


Vaithan

_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp

