The table below represents a tree stored in a computer's memory. Each node of the tree contains three cells. The first cell contains the data to be stored; the second cell contains a pointer to the first cell's left child, and the third cell contains a pointer to the first cell's right child. A value of 00 as a pointer represents the nil pointer. A separate variable points to the root of the tree. The root of the tree is the cell that starts at 4F; that is, the variable that holds the root pointer has the value 4F. Fill in the resulting tree. Draw a picture of the resulting tree. (One way to draw a picture of a binary tree using typewriter graphics is by using / to indicate a left pointer and \ to indicate a right pointer. You can see an example of that in the next problem.)

Address Contents

40 A1

41 00

42 00

43 B2

44 00

45 00

46 D4

47 49

48 00

49 C3

4A 00

4B 00

4C E5

4D 43

4E 40

4F F6

50 46

51 4C