LCA – Lowest Common Ancestor
Tutorial on LCA algorithm. We use Binary Lifting to get O(N*log(N)) preprocessing and O(log(N)) to find the lowest common ancestor of two nodes in a tree. Binary Lifting video • Binary Lifting (Kth Ancestor of a Tree Node) SPOJ problem https://www.spoj.com/problems/LCASQ/ code https://github.com/Errichto/youtube/b... Two homework problems: 1) Answer queries "find distance between two given nodes U and V" https://cses.fi/problemset/task/1135 2) Given a tree with weighted edges (i.e. every edge has some value), answer queries "given two nodes U and V, find minimum weight along path U-V". (I don't have a source for this one). Coding live streams - / errichto FAQ - https://github.com/Errichto/youtube/w... Subscribe for more educational videos on algorithms, coding interviews and competitive programming.
Sparse Table & RMQ (Range Minimum Query)
Binary Lifting (Kth Ancestor of a Tree Node)
We're 99.9% sure this pattern is true, but no one can prove it
L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java
I Gave ChatGPT a Body
Lowest Common Ancestor - O(logN) | Binary Lifting
Introduction to Binary Lifting for Competitive Programming.
نتدرب ونجهز ازاي لل ECPC مع عدم وجود كوتش
Binary Search tutorial (C++ and Python)
I Hacked This Temu Router. What I Found Should Be Illegal.
How to Actually Learn C (2027 Edition)
Animation vs. Math
The Hardest Author Times Beaten in Trackmania
The hidden logic behind #, @, & and §
LOWEST COMMON ANCESTOR OF A BINARY TREE I | PYTHON | LEETCODE 236
Can $200 ChatGPT Solve my Math PhD Thesis?
The Strange Math That Predicts (Almost) Anything
I Made Opus 4.8 and Fable 5 Build the Same App (RAW RESULTS)
