Let T, ≻) be a game tree (arborescence). For every non initial node, call p(t) = sup ≺(t) the immediate predecessor of t. Show that
1. p(t) is unique for every t ∈ T\W.
2. There is a unique path between any node and an initial node in a game tree.