Lesson 5, exam questions

We will focus on exam 050111.

Update

A remark regarding our discussion on predecessor (föregångare) in a BST. In a BST, the predecessor to a node n is the node with the next smaller key. However, in graph algorithms, we sometimes use the term predecessor to refer to the parent in the tree produced by for instance a BFS.
Krister