Each node in a binary tree can be stored using 3 memory locations. The first hol

Question

Each node in a binary tree can be stored using 3 memory locations. The first holds
the key value of the node (a letter here), the second contains a pointer to the node's
left child and the third contains a pointer to the right child. Using this representation
method, fill-in the pointer fields so that the table represents the tree given below.
What should the value of the root pointer be?

Address Contents
30 T
31
32
33 Z
34
35
36 S
37
38
39 I
40
41
42 R
43
44
45 K
46
47

R
/

K T

/ /
I s z

Value of root pointer is:

Explanation / Answer

Address     Contents

30              T

31              36

32              33

33              Z

34              0

35              0

36              S

37              0

38              0

39              I

40              0

41              0

42             R

43              45

44              30

45              K

46              39

47              0

9.2       Value of root pointer is: ___42____

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.