  This note describes a very simple O(1) query time algorithm for finding level
ancestors. This is basically a serial (re)-implementation of the parallel
algorithm of Berkman and Vishkin (O.Berkman and U.Vishkin, Finding
level-ancestors in trees, JCSS, 48, 214--230, 1994).
  Although the basic algorithm has preprocessing time of O(n log n), by having
additional levels or using table lookup, the preprocessing time can be reduced
to almost linear or linear.
  The table lookup algorithm can be built in O(1) parallel time with $n$
processors and can also be used to simplify the parallel algorithm of Berkman
and Vishkin and make it optimal.
