Fig. (2)
Partitioning a node for recursive definition. Leftmost square: height =
i
+
1
. Rightmost square: Height =
i
.