Question

which of the following is a true about binary trees every complete binary tree is also a full binary tree. every full binary tree is also a complete binary tree no binary tree is both complete and full. none of above

Answer 1

Every full binary tree is also a complete binary tree no binary tree is both complete and full.

Answer 2

None of the above. Option (4)

• A binary tree is a data structure in which a record is linked to two successor records, the left branch when the previous record is greater and the right branch when the previous record is less.

• Different binary trees -

1. Every node, excluding the leaf nodes, has two offspring in a full/strictly binary tree.
2. Every level except the last one is completely filled, and all nodes are justified.
3. Every node save the leaf nodes has two offspring, and every level (including the last level) is entirely filled.

• A full binary tree (also known as a proper binary tree, 2-tree, or strictly binary tree) is a tree with two children for every node except the leaves.

#SPJ1