Question about Complete binary tree

Question

4. Which of the following is a true about Binary trees?

(a) Every binary tree is either complete or full

(b) Every complete binary tree is also a full binary tree

(c) Every full binary tree is also a complete binary tree

(d) None of these

Solution: Option (d)

Please Explain why option c is not correct?

 

Comments

@Magma

which book r u following?

---

Mam acc to Narasimha karumanchi option C is valid

Then you read it https://www.quora.com/What-is-the-difference-between-complete-and-full-binary-trees

Read the answer of Associate proff of vrije

---

@Magma

oh , yes it is perfect binary tree

u r right 

wiki also telling that https://en.wikipedia.org/wiki/Binary_tree

but C) also not valid

see definition 

In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible

So, valid option is D)