If you can explain why. Full binary tree needs to have a node with 0 or 2 children and a complete tree have their child starting from the left.
Select the one true statement.
* 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. No binary tree is both complete and full.