CS-62 JUNE 2003 QNO 2(a)
QuestionDraw the internal memory representation of the following Binary Tree using Sequential Representation. Assume that nodes appear in the following physical sequence:
A, B, C, D, E, G, F, H
Answer
| Index | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| Value | A | B | C | D | E | G | F | H |
No comments:
Post a Comment