how to construct a b+ tree
From: Kuldip Sangha <Kuldip_Sangha_at_yahoo.com>
Date: 14 Oct 2001 18:02:04 -0700
Message-ID: <ce949ec9.0110141702.7518e14f_at_posting.google.com>
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. Received on Mon Oct 15 2001 - 03:02:04 CEST
Date: 14 Oct 2001 18:02:04 -0700
Message-ID: <ce949ec9.0110141702.7518e14f_at_posting.google.com>
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. Received on Mon Oct 15 2001 - 03:02:04 CEST