(Simple) Binary Tree?

Article View: comp.lang.c++.leda

Article #161

Back to comp.lang.c++.leda Previous Next

#161

From: Jan Vahrenhold
Date: Mon, 13 Nov 1995 09:55

5 lines
698 bytes

Hi,

has anyone experienced with using a simple binary tree
with LEDA-R-3.2.3? Specifically, how can I use such 
a non-balanced tree with LEDA?

Technical Details

Message-ID: <4874m5$1ctq@majestix.uni-muenster.de>

Path: arc1-ca.pugleaf.net!uni-muenster.de!news

References: <476m9h$rlr@hkein.ie.cuhk.hk>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!uni-muenster.de!news
From: Jan Vahrenhold <jan>
Newsgroups: comp.lang.c++.leda
Subject: (Simple) Binary Tree?
Date: 13 Nov 1995 09:55:17 GMT
Organization: Westfaelische Wilhelms-Universitaet Muenster, Germany
Message-ID: <4874m5$1ctq@majestix.uni-muenster.de>
References: <476m9h$rlr@hkein.ie.cuhk.hk>
NNTP-Posting-Host: clapton.uni-muenster.de
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Mailer: Mozilla 1.1N (X11; I; SunOS 5.4 sun4m)
X-URL: news:476m9h$rlr@hkein.ie.cuhk.hk

Reply to Parent Message