Re: how to construct a b+ tree
From: Simon Richter <geier_at_phobos.fs.tum.de>
Date: Mon, 15 Oct 2001 05:05:44 +0200
Message-ID: <Pine.LNX.4.33.0110150501470.27577-100000_at_phobos.fachschaften.tu-muenchen.de>
Date: Mon, 15 Oct 2001 05:05:44 +0200
Message-ID: <Pine.LNX.4.33.0110150501470.27577-100000_at_phobos.fachschaften.tu-muenchen.de>
On 14 Oct 2001, Kuldip Sangha wrote:
> Construct a B+-tree with n = 3 (maximum three pointers per node),
> containing the following items, entered into the tree in the following
> order:
> 14, 33, 24, 5, 38, 11, 22, 17, 39, 23
> - Show the steps in constructing your tree, with a sketch for each
> time a new node is added.
This is just a special case of what you heard in your lecture. :-)
Simon
-- GPG public key available from http://phobos.fs.tum.de/pgp/Simon.Richter.asc Fingerprint: DC26 EB8D 1F35 4F44 2934 7583 DBB6 F98D 9198 3292 Hi! I'm a .signature virus! Copy me into your ~/.signature to help me spread!Received on Mon Oct 15 2001 - 05:05:44 CEST