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

A. Complete binary tree
B. Binary search tree
C.   Extended binary tree
D. None of above

Ans:  C