Chapter 8, Problem 29CRP

Explanation of Solution

Determine the tree as,

To define a node, take $3$ consequent memory locations into consideration which means the first location contains data, second location contains memory of the left child and the third child location contains the memory location for the right side.

• The root the tree is $55$.
  • $55$ has the data $W$ (first cell).
• The left child is $46$ (second cell)-memory location of the left child.
• The right child is $52$ (third cell)-memory location of the right child.

Now, consider the left child of the root. Then,

• $46$ has data $J$ (first cell).
• The left child of $46$ is $49$ (second cell) and right child of $46$ is also $49$ (third cell)