\texttt{
  \begin{itemize}
  \item<1-> E=[n1, n2, n4, n2, n5, n6, n5, n2, n1, n3, n1]
  \item<2-> L=[ 0, \ 1, \ 2, \ 1, \ 2, \ 3, \ 2, \ 1, \ 0, \ 1, \ 0]
  \item<3-> R=[1, 2, 10, 3, 5, 6]
    \newline
  \item<4-> Nodes between first visits to $u$ and $v$
    E[R[u],...,R[v]] (or E[R[v],...,R[u]]).
  \item<5-> Shallowest node is at index $RMQ_L(R[u],R[v])$.
  \item<6-> $LCA_T(u,v) = E[RMQ_L(R[u],R[v])]$
  \end{itemize}
}