Optimality Principle 1
In an optimal Huffman tree a lowest probability symbol has maximum distance from the root.
- If not exchanging a lowest probability symbol with one at maximum distance will lower the cost.
C(T’) = C(T) + 4p - 4q + 2q - 2p = C(T) - 2(q-p) > C(T)