B-trees Help!

Article View: aus.computers.java

Article #1130

Back to aus.computers.java Previous Next

#1130

From: Samuel Chan
Date: Tue, 18 May 1999 00:00

13 lines
1421 bytes

I need help in programming a B tree of order 4 (also called a 2-3
tree).  Can anyone help me with any tips or hints on how to go about
doing this. I know about the concepts of the tree, but the coding of it
has me confused. I would greatly appreciate it if anybody has anything
to say about it, or even better, if anyone has any example code, could
they please please attach it to an email and fire it off to me. Any
advice would be great, also if you have code that does it recursively or
code that does it by iterators is also greatly apreciated. The biggest
problem i have, apart from trying to code it is, how do i try keep the
tree balanced all the time. Thanks for taking the time to read my
requests.

Sam

Technical Details

Message-ID: <37414EEE.AD478966@ug.cs.usyd.edu.au>

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: 10d6db,722c294495b68ce9,start
X-Google-Attributes: gid10d6db,public
From: Samuel Chan <schan2@ug.cs.usyd.edu.au>
Subject: B-trees  Help!
Date: 1999/05/18
Message-ID: <37414EEE.AD478966@ug.cs.usyd.edu.au>
X-Deja-AN: 479390728
Content-Transfer-Encoding: 7bit
X-Accept-Language: zh,zh-CN,zh-TW,ja,ko,fr,fr-BE,en
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: usenet@news.usyd.edu.au
X-Trace: metro.ucc.usyd.edu.au 927026880 4684 10.0.27.31 (18 May 1999 11:28:00 GMT)
Organization: The University of Sydney, Australia
Mime-Version: 1.0
NNTP-Posting-Date: 18 May 1999 11:28:00 GMT
Newsgroups: aus.computers.java