Data Structures, Algorithms, & Applications in Java
Chapter 12, Exercise 9

When m is zero, the binary tree must be empty. There is no limit on the number of nodes so long as

m
>= 1

. For example, a left skewed binary tree with height h >= 1 has h nodes and only one leaf.