ConceptSystems & CS
Lowest common ancestor
Pre-process a rooted tree to quickly find the lowest node that is an ancestor of both given nodes and .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Andy Pavlo
The lowest ancestor operator in a tree that accesses a column and provides a column to determine if a join is dependent.
Lectures that assume it
1Connections
9The lectures that define it or assume it, and the concepts next to it.