The tree-insertion algorithms we have previously seen add new nodes at the bottom of the tree, and then have to worry about whether they have created an imbalance. The B-tree insertion algorithm is just the opposite: it adds nodes at the top. All nodes become 1 level deeper: the tree remains balanced.