A binary tree whose every node has either zero or two children is called
A binary tree whose every node has either zero or two children is called a full binary tree.
A binary tree whose every node has either zero or two children is called a full binary tree.