Path: utzoo!utgpu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!sdd.hp.com!decwrl!mcnc!uvaarpa!murdoch!mithras.cs.Virginia.EDU!md8d
From: md8d@mithras.cs.Virginia.EDU (Mriganka Das )
Newsgroups: alt.sources
Subject: DRAWING binary trees, NEED  code, have any handy?
Message-ID: <1991Mar16.074601.893@murdoch.acc.Virginia.EDU>
Date: 16 Mar 91 07:46:01 GMT
Sender: usenet@murdoch.acc.Virginia.EDU
Reply-To: md8d@mithras.cs.Virginia.EDU (Mriganka Das )
Organization: University of Virginia Computer Science Department
Lines: 22

Hi netters,
	Not wanting to re-invent the wheel, I would like to know if 
anyone has code to DRAW AN (UNBALANCED) BINARY TREE, with a three-tuple
of integers as node labels. Obviously any well written code will render
irrelevant whether it's a 3-tuple labelling and whether it is unbalanced
but I threw them in for the sake of completeness.

I would prefer ANSI C, C or Pascal code in that order. I am prepared to
give whatever type of input is required, i.e parent pointer, or leftchild
rightchild representation, by such a code fragment.

Thanks in advance. Any help will be sincerely appreciated and 
acknowledged. We are trying to grow some cluster trees, and need them
fast for a submission deadline, else I would have coded them myself.

I guess it would be preferable to mail replies directly to me. 

								- Mrigank.