#### 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),
pages 178-180 (Section 5.4.1),
pages 186-187 (Section 5.4.4)

(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),
pages 263-265 (Section 6.4.1),
pages 272-271 (Section 6.4.4)

#### Additional material

Implementation of a positional sequence/list by means of a
double linked list in pseudocode:
PostScript and
PDF
DNode

NodeList

BTNode

LinkedBinaryTree

TNode

LinkedTree

Implementation of a general tree with a binary tree in pseudocode:
PostScript and PDF

#### Question

Give the pseudocode for removeAboveExternal in the implementation of a
binary tree with an array.