Reading material

If you use the first edition of the textbook, follow the reading material in orange. If you use the second edition, follow the reading material in brown.

(1st) pages 126-132 (Section 4.2.5), pages 133-134 (Section 4.3.2), pages 180-184 (Section 5.4.2), page 185 (Section 5.4.3)

(2nd) pages 198-205 (Section 5.2.4), pages 206-208 (Section 5.3.2), pages 265-271 (Section 6.4.2), pages 271-271 (Section 6.4.3)

Additional material

Implementation of a positional sequence/list by means of a doubly linked list with dummy nodes in pseudocode: PostScript and PDF

DNode
NodeList
BTNode
LinkedBinaryTree
TNode

Question

For the implementation of a (general) tree with a linked structure, give