Data Structures Using C, 2nd Edition by Pearson

284 Data Structures Using C

From Figure 7.5, the following compo-

nents of a tree can be identified:

Root : A

Child nodes of A : B, C, D

Sub-Trees of A : T1, T2, T3

Root of T1 : B

Root of T2 : C

Root of T3 : D

Leaf nodes : E, G, H, I, J, K, L

Before proceeding to discuss more on

trees, let us have a look at basic terminology

used in context of trees as given in Section 7.2.

7.2 BASIC TERMINOLOGY

Parent: An immediate predecessor of a node is called its parent.

Example: D is parent of I and J.

Child: The successor of a node is called its child.

Example: I and J are child nodes of node D.

Sibling: Children of the same parent are called siblings. ...