In a binary tree a node can have maximum two children, or in other words we can say a node can have 0,1, or 2 children.
Its properties are as follows.
The maximum number of nodes on any level i is 2i where i>=0.
The maximum number of nodes possible in a binary tree of height h is 2h-1.
The minimum number of nodes possible in a binary tree of height h is equal to h.
If a binary tree contains n nodes then its maximum possible height is n and minimum height possible is log2 (n+1).
If n is the total no of nodes and e is the total no of edges then e=n-1.The tree must be non-empty binary tree.
If n0 is the number of nodes with no child and n2 is the number of nodes with 2 children, then n0=n2+1.