m-way tree building

Article View: comp.ai

Article #8854

#8854

From: swaminathan.ravikumar
Date: Fri, 09 Feb 1990 16:38

28 lines
789 bytes

I have the following facts asserted in the prolog database:

	linked(a, b).
	linked(a, c).
	linked(b, d).
	linked(b, e).
	linked(b, f).

and I want to construct an "m-way" tree strcuture as follows:

		a
		|
	     -------
	     |     |
	     b     c
	     |
           -----	   
	   | | |
	   d e f

I would appreciate any suggestions or pointers to reference
materials on doing this.

Thanks.

-- ravi
skumar@hocus.att.com

Technical Details

Message-ID: <8053@cbnewsh.ATT.COM>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!rutgers!att!cbnewsh!skumar

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!rutgers!att!cbnewsh!skumar
From: skumar@cbnewsh.ATT.COM (swaminathan.ravikumar)
Newsgroups: comp.ai
Subject: m-way tree building
Keywords: m-way trees
Message-ID: <8053@cbnewsh.ATT.COM>
Date: 9 Feb 90 16:38:26 GMT
Organization: AT&T Bell Laboratories
Lines: 28