1. Recursively traverse the tree.
2. At each node, determine if its left and right child nodes are null.
2a. If true, return 1.
2b. Otherwise, find number of leaves in its left and right subtrees (recursively).
3. Return the sum of the number of leaves in the left and the right subtrees.