The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 4 Days Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
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.
|
Address |
Contents |
|
40 |
G |
|
41 |
0 |
|
42 |
0 |
|
43 |
X |
|
44 |
0 |
|
45 |
0 |
|
46 |
J |
|
47 |
49 |
|
48 |
0 |
|
49 |
M |
|
50 |
0 |
|
51 |
0 |
|
52 |
F |
|
53 |
43 |
|
54 |
40 |
|
55 |
W |
|
56 |
46 |
|
57 |
52 |
Â
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll