EPI - Q9.14 - LCA in less than O(h) time

In fact in O(max(d_a - d_l, d_b - d_l)) time using
O(max(d_a, d_b)) space. Just use a Set to store all visited nodes
whilst iterating both nodes in lockstep to the root.