Data Structures Using C, 2nd Edition by Pearson

Trees 289

7.4.2 Linked Representation of a Binary Tree

A critical look at the organization of a non-empty binary tree suggests that it is a collection of nodes.

Each node comprises the following:

n It contains some information.

n It has an edge to a le child node.

n It has an edge to a right child node.

The above components of a node can be comfortably

represented by a self-referential structure consisting of

DATA part, a pointer to its left child (say leftChild), and

a pointer to its right child (say rightChild) as shown in

Figure 7.13.

Now the node shown in Figure 7.13 will become the

building block for construction of a binary ...