What is the max number of leaf nodes in a classifcation decision tree?

Let's assume that we have n observations and p predictors and we have in a np situation. All predictors are binary. What is the max number of leaf nodes that we can have in the tree? and what are the maximal number of internal nodes? What is the math behind this, can someone offer some insight?