Explain in detail in a binary tree of n nodes there are n plus 1 null pointers representing children?

Induction:

1. A tree of one node has two NULL-pointers.

2. Whenever you add a node to a tree, you remove one NULL-pointer (from the parent of the new node), and add two (the child's of the new node) in the same time.