From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.1 required=5.0 tests=BAYES_05,FREEMAIL_FROM,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,dfa76ffcbaad9c0,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-02-27 18:08:05 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!netnews.upenn.edu!dsinc!newsfeed.pitt.edu!gatech!howland.reston.ans.net!swiss.ans.net!newstf01.news.aol.com!newsbf02.news.aol.com!not-for-mail
From: beavismike@aol.com (BeavisMike)
Newsgroups: comp.lang.ada
Subject: Breadth first print procedure for binary search trees
Date: 27 Feb 1995 21:08:05 -0500
Organization: America Online, Inc. (1-800-827-6364)
Sender: root@newsbf02.news.aol.com
Message-ID: <3iu0i5$gup@newsbf02.news.aol.com>
Reply-To: beavismike@aol.com (BeavisMike)
NNTP-Posting-Host: newsbf02.mail.aol.com
Date: 1995-02-27T21:08:05-05:00
List-Id: <comp.lang.ada>

does anyone have any source or detailed algorithm for a breadth first
print procedure?  thanks in advance.
Mike
beavismike@aol.com