trees and external storage ab figure splitting the root figure shows node split that ripples up through tree until it reaches the root figure splits rippling up tree implementation we'll leave complete java implementation of - tree as an exercise howeverwe'll finish with some hints on how to handle splits this is only one approach (another involves allowing each node to hold phantom fourth childon the way down the insertion routine doesn' care if the nodes it encounters are full or not it searches down through the tree until it finds the appropriate leaf if the leaf is not fullit inserts the new value howeverif the leaf is fullit must rearrange the tree to make room to do thisit calls split(method arguments to this