Characteristics of B+ Tree:
1. Data records are stored only in leaves
2. Internal nodes just stores keys
3. The leaf nodes, form the first level of the index, with the internal nodes forming the other levels of a multilevel index.
The structure of the internal nodes of a B+ tree of order ‘a’ is as follows:
.
$p_{1}$ |
$k_{1}$ |
$p_{2}$ |
$k_{2}$ |
... |
$p_{n-1}$ |
$k_{n-1}$ |
$p_{n}$ |
So, I thought the B+ tree's internal node will be something like this and I am not sure whether the concept is like this:
$p_{1}$ |
$k_{1}$ |
$p_{2}$ |
$k_{2}$ |
..... |
$p_{10}$ |
$k_{10}$ |
$p_{11}$ |
Please check whether it's right @srestha