42Chap. 6 General TreesNode0123456789101112131415Parent4444-144004999129-16.8For eight nodes labeled 0 through 7, use the following series of equivalences:(0, 1) (2, 3) (4, 5) (6, 7) (4 6) (0, 2) (4 0)This requires checking fourteen parent pointers (two for each equivalence),but none are actually followed since these are all roots. It is possible todouble the number of parent pointers checked by choosing direct children ofrootsineachcase.6.9For the “lists of Children” representation, every node stores a data value and apointer to its list of children. Further, every child (every node except the root)has a record associated with it containing an index and a pointer. Indicatingthe size of the data value asD, the size of a pointer asPand the size of anindex asI, the overhead fraction is3P+ID+3P+I.For the “Left Child/Right Sibling” representation, every node stores three
This is the end of the preview.
access the rest of the document.