Before revision: We present the first succinct  data structure for ordinal trees that supports the mapping between the preorder (i.e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time.
After revision: We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between the preorder (i.e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time.