Chapter Review Problems

The table below represents a tree stored in a

machine's memory. Each node of the tree consists of

three cells. The first cell contains the data $($a letter$),$ the

second contains a pointer to the node's left child, and the

third contains a pointer to the node's right child. A value

of $0$ represents a NIL pointer. If the value of the root

pointer is $55,$ draw a picture of the tree.