Answer: D) Complete
Explanation:
A binary tree is said to be complete when, all the levels are completely fill except the last level. All the nodes leave in last level are all fill from left to right side in the binary tree.
If the current node in the binary tree indicated null value then, the tree are completely filled. If the last level is completely filled then,complete binary tree is known as perfect binary tree.
