úÎ&W     portable experimentalEdward Kmett <ekmett@gmail.com> Safe-InferedThe empty path O(1) O(1) O(1)1 Invariant: most operations assume that the keys k are globally unique O(h - k) to keep k elements of path of height h O(k) to drop k elements from a path O(h)$ Compute the lowest common ancestor O(1)4 Compare to see if two trees have the same leaf key        portable experimentalEdward Kmett <ekmett@gmail.com> Safe-Infered 7Compressed paths using skew binary random access lists The empty path O(1) O(1) O(1)1 Invariant: most operations assume that the keys k are globally unique O(log (h - k)) to keep k elements of path of height h O(log k) to drop k elements from a path O(log h)$ Compute the lowest common ancestor O(1)4 Compare to see if two trees have the same leaf key   !"    !"#           lca-0.1.0.1Data.LCA.Online.NaiveData.LCA.OnlinePathtoListfromListtraverseWithKeyemptylengthnullconskeepdroplca isAncestorOf~=$fTraversablePath$fFoldablePath $fFunctorPath$fTraversableTree$fFoldableTree $fFunctorTree