Question

Q 3 Consider a complete and full binary tree, T. Identify the correct statement.
​

Answer 1

Answer:

A full binary tree (sometimes proper binary tree or 2-tree) is a tree in which every node other than the leaves has two children. A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

Answer 2

Answer:

A full binary tree (also known as a correct binary tree or 2-tree) is a tree in which every node has two offspring save the leaves.

Explanation:

Every binary tree is either full or complete. A full binary tree is the same as a complete binary tree. It's a full binary tree if a binary tree node is NULL.

If a binary tree node has empty left and right subtrees, it is considered a complete binary tree.

By definition, a binary tree node with left and right subtrees is a portion of a whole binary tree.

#SPJ3