Binary Trees

Article View: fj.lang.visualbasic

Article #265

Back to fj.lang.visualbasic Previous Next

#265

From: Ben Smith
Date: Tue, 07 Apr 1998 00:00

18 lines
1025 bytes

Hi,

I'm trying to make a Binary Tree program in Visual Basic5

I'm a bit stuck on writting the code to find the predecessor and
successor of a node. And also on the Preorder and Postorder traversal.
I can do the inorder code, if they are similar.

Is there anyone who could help me?

Please respond by e-mail: 

bsmith01@globalnet.co.uk

Thanks,

Ben Smith

Technical Details

Message-ID: <352a5ab0.6533138@news.globalnet.co.uk>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 110a07,82545214f2a5062d,start
X-Google-Attributes: gid110a07,public
X-Google-Thread: 107d8b,82545214f2a5062d,start
X-Google-Attributes: gid107d8b,public
X-Google-Thread: 105c2e,82545214f2a5062d,start
X-Google-Attributes: gid105c2e,public
X-Google-Thread: 108717,82545214f2a5062d,start
X-Google-Attributes: gid108717,public
From: bsmith01@globalnet.co.ukX (Ben Smith)
Subject: Binary Trees
Date: 1998/04/07
Message-ID: <352a5ab0.6533138@news.globalnet.co.uk>
X-Deja-AN: 341753410
Newsgroups: fj.lang.visualbasic,a.bsu.programming,comp.programming,fj.os.ms-windows.programming