Lowest Common Ancestor - O(logN) | Binary Lifting
In this video I will be discussing on how to find the lowest common ancestor (lca) of 2 nodes in O(logn) time using a technique known as binary lifting. It is very useful in competitive programming and one must definitely know this technique. (eg : it becomes very easy to calculate the distance between two nodes in a tree). Code - https://pastebin.com/984x2WPK
▶︎
Binary Lifting (Kth Ancestor of a Tree Node)
▶︎
LCA – Lowest Common Ancestor
▶︎
Factor Tree - Mo's algorithm on Trees | Codechef April Long Challenge 2020
▶︎
Hough Transform: Algorithms for Grad Students (2)
▶︎
L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java
▶︎
LCA — Lowest Common Ancestor | 2 Methods: Euler Tour + Binary Lifting | C++ | DSA
▶︎
Trie Data Structure
▶︎
Why RSA encryption actually works (no prior knowledge required)
▶︎
Watch this if everything feels too much (gentle comfort for tired women)
▶︎
Ones and Zeros Multiple (SPOJ / Polish Olympiad)
▶︎
Magnus Teaches the London System (to every Elo)
▶︎
How to stop an evil postman (ft. Amit Sahai)
▶︎
Lowest Common Ancestor W/ Binary Lifting
▶︎
Understanding B-Trees: The Data Structure Behind Modern Databases
▶︎
Lowest Common Ancestor | Reusable Template | Binary Lifting | Concepts & Questions - 3 | MIK
▶︎
Perfect Power Divisors (PPDIV) | Codechef April Long Challenge 2020
▶︎
Lowest Common Ancestor in Binary Tree | DSA Series : L.89
▶︎
Design Principles with Pointer Parameters and Functions
▶︎
NFA to Regex Conversion Example #1, "Simple" (GNFA Method)
▶︎