CS 491 CAP (Spring 2025)

Home

❯

Lectures

❯

Binary Lifting and Least Common Ancestor

Binary Lifting and Least Common Ancestor

May 07, 20251 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

Backlinks

  • Lecture Schedule

Created with Quartz v4.5.0 © 2025

  • GitHub
  • Discord Community