CS 491 CAP (Sp26)

Home

❯

Lecture Schedule

❯

Binary Lifting and Least Common Ancestor

Binary Lifting and Least Common Ancestor

Feb 17, 20261 min read

Today we will talk about a technique to greatly increase search speed over data structures that would appear to be linear at first.

Slides

  • Mattox’s Slides
  • David Fu’s Slides (PDF)

Graph View

Created with Quartz v4.5.1 © 2026

  • GitHub
  • Discord Community