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) + hp - hq + kq - kp = C(T) - (h-k)(q-p) < C(T)