Height of a B-tree (cont.)
First, notice that the root of T’ has only one entry, otherwise we could find a sub B-tree of T’ of height h and with fewer entries, contradicting the minimality of N’.
Similarly, all the other nodes of T’ have the minimum number of entries for a B-tree of order m. That is they contain exactly entries.