In worst case you can have only one children at each node, in that case you will have your binary tree structure similar to a list and at each level you will be having a single node, so if height of tree is h then in total you will have h node only as minimum number of node of binary tree.

such structure will look like this :

4

\

3

\

1