A full binary tree in which all internal node will have 2 children all leaf nodes(last level) will have 0 childrens.

A complete binary tree is in which tree is filled as much as left as possible. Like in heap we make complete binary tree.(First all left side nodes are filled than we fill the right sub-tree).

A strict binary tree will be if every non-leaf node is filled with a node. No non;leaf node will be empty.

A complete binary tree is in which tree is filled as much as left as possible. Like in heap we make complete binary tree.(First all left side nodes are filled than we fill the right sub-tree).

A strict binary tree will be if every non-leaf node is filled with a node. No non;leaf node will be empty.