Editing B+ tree (section)

=== Node bounds ===
The node bounds are summarized in the table below:<ref name="algorithms-pdf" /><ref>{{Cite book |last1=Silberschatz |first1=Abraham |title=Database system concepts |last2=Korth |first2=Henry F. |last3=Sudarshan |first3=S. |date=2020 |publisher=McGraw-Hill Education |isbn=978-1-260-08450-4 |edition=Seventh |location=New York, NY}}</ref>
{| class="wikitable"
|-
! rowspan="2" | Node Type 
! colspan="2" | Number of Keys
! colspan="2" | Number of Child Nodes
|-
! Min !! Max
! Min !! Max
|-
| Root Node (when it is a leaf node) || 0 || {{mvar|K}}
|0
|0
|- 
| Root Node (when it is an internal node) || 1 || {{mvar|K}}
|2<ref name="Navathe" />
|<math> K + 1 </math>
|-
| Internal Node || <math> \lfloor K/2 \rfloor </math>|| {{mvar|K}}
|<math> \lceil (K + 1)/2 \rceil \equiv \lfloor K / 2 \rfloor + 1 </math>
|<math> K + 1 </math>
|-
| Leaf Node || <math>  \lceil K / 2 \rceil </math>|| {{mvar|K}}
|0
|0
|}