PS10: Graphs & Trees

Do these problems from the book, listed on page 1140.

1. 11.109
2. 11.110

Also do these problems, listed on pages 1155–1157.

1. 11.112
2. Question 4 has been cancelled! 11.118 (Note that in a complete directed graph, for ever pair of distinct nodes $u$ and $v$, the path $(u, v, u)$ is a valid simple cycle: it has at least two edges, and never reuses an edge.)
3. 11.128
4. 11.146 (The definition of “complete binary tree” is above question 1.143.)