Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!decwrl!pa.dec.com!decprl!decprl!boyd
From: boyd@prl.dec.com (Boyd Roberts)
Newsgroups: comp.lang.c
Subject: Re: sorting doubly linked list
Message-ID: <1991May15.162039.18822@prl.dec.com>
Date: 15 May 91 16:20:39 GMT
References: <OLSON.91May13142102@sol.aaet.csc.ti.com> <1991May14.112315.496@klaava.Helsinki.FI> <5772@goanna.cs.rmit.oz.au>
Sender: news@prl.dec.com (USENET News System)
Reply-To: boyd@prl.dec.com (Boyd Roberts)
Distribution: comp
Organization: Digital Equipment Corporation - Paris Research Laboratory
Lines: 8

Just add an extra pointer and turn the list into a binary tree and
do an `infix' traversal.  This is the Doug Gwyn prefered method posted
some months ago to a similar request.


Boyd Roberts			boyd@prl.dec.com

``When the going gets wierd, the weird turn pro...''