Data Structures Using C, 2nd Edition by Pearson

286 Data Structures Using C

Consider the binary tree given in Figure 7.10 which violates the condition of the complete binary

tree as the node number 11 is missing. Therefore, it is not a complete binary tree because there is a miss-

ing intermediate node before the last node, i.e., node number 12.

Fig. 7.8 A full binary tree

H I

D E

A

J K L M

F G

B C

N O

Fig. 7.9 Complete binary tree

8 9

4 5

1

10 11 12

6

7

2 3

Fig. 7.10 An incomplete binary tree

8 9

4 5

1

10 1312

6

7

2 3

7.3.1 Properties of Binary Trees

The binary tree is a special tree with degree 2. Therefore, it has some specific properties which must be

considered by the students before implementing binary ...