In а (2,4) tree implementаtiоn, the insert methоd оften cаlls splitChild before recursively descending to the child node, as shown below: private void insertNonFull(Node<T> node, T key) { // ... find correct child index 'i' to descend into ... // Check if the child we are about to visit is a 4-node (i.e., full) if (node.children.get(i).keys.size() == 3) { // If it's full, split it first splitChild(node, i, node.children.get(i)); // After splitting, the key might belong in the new child if (key.compareTo(node.keys.get(i)) > 0) { i++; } } // Now, recursively insert into the child, // which is guaranteed NOT to be full. insertNonFull(node.children.get(i), key); What is the advantage of this "proactive" splitting (splitting a 4-node on the way down before you get to it)?