Add iterative algorithm for lowest common ancestor

I have added an implementation for the famous interview question asking
for computing the lowest common ancestor of two nodes. This is the
iterative implementation, there is also a recursive variant.

Signed-off-by: Konrad Reiche <konrad.reiche@gmail.com>