figure -tree after insertion of into the tree in figure leavesboth guaranteed to have the minimum number of data records needed we form two leaves with three items each two disk accesses are required to write these leavesand third disk access is required to update the parent note that in the parentboth keys and branches changebut they do so in controlled way that is easily calculated the resulting -tree is shown in figure although splitting nodes is time-consuming because it requires at least two additional disk writesit is relatively rare occurrence if is for examplethen when node is splittwo leaves with and itemsrespectivelyare created for the leaf with itemswe can perform more insertions without another split put another wayfor every splitthere are roughly / nonsplits the node splitting in the previous example worked because the parent did not have its full complement of children but what would happen if it didsupposefor examplethat we insert into the -tree in figure we must split the leaf containing the keys through and now into two leaves but doing this would give the parent six childrenand it is allowed only five the solution is to split the parent the result of this is shown in figure when the parent is splitwe must update the values of the keys and also the parent' parentthus incurring an additional two disk writes (so this insertion costs five disk writeshoweveronce againthe keys change in very controlled manneralthough the code is certainly not simple because of host of cases figure insertion of into the -tree in figure causes split into two leaves