# Data Structures | Binary Trees | Question 1

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)** No binary tree is both complete and full.

**(E)** None of the above

**Answer:** **(E)** **Explanation:** A full binary tree (sometimes proper binary tree or 2-tree or strictly binary 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.

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 not complete

12 / \ 20 30 / \ 20 40

D) is incorrect. Following Binary tree is both complete and full

12 / \ 20 30 / \ 10 40

Please refer http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees

Quiz of this Question

## Recommended Posts:

- Data Structures | Binary Trees | Question 13
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 3
- Data Structures | Binary Trees | Question 4
- Data Structures | Binary Trees | Question 6
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 9
- Data Structures | Binary Trees | Question 15
- Data Structures | Binary Trees | Question 12
- Data Structures | Binary Trees | Question 10
- Data Structures | Binary Trees | Question 11
- Data Structures | Binary Trees | Question 14
- Data Structures | Binary Trees | Question 8
- Data Structures | Binary Search Trees | Question 6
- Data Structures | Binary Search Trees | Question 10