Page 548 Exercise 1

Page 536 of the text indicates that B-trees of order 2 full binary trees.
Chapter 5 of the text defines a full binary tree of depth k as one which contains 2^k-1 nodes.  This is illustrated nicely in Figure 5.11.