Binary Trees Quiz 1

Question :

Which of the following is 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.

None of the above

Solution :

D) is correct.

A full binary tree is a tree in which every node other than the leaves has two children. A complete binary tree is a tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
A) is incorrect. For example, the following Binary tree is neither complete nor full
                             12
                            /
                           20
                          /
                         30
B) is incorrect. The following binary tree is complete but not full
                             12
                            /  \
                           20   30
                          /
                         30
C) is incorrect. Following Binary tree is full, but it is not complete
                             12
                            /  \
                           20   30
                          /       \
                         20        40
D) is correct. As all above options are incorrect.

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.