For a B-tree, the height of the tree affects both the search and insertion times. The worst-case search or insertion time should be measured, ideally. Take a look at a degree d B-tree with n total keys. Create an inequality that displays an upper bound for the relationship between the variables d and n and the tree's height, h.