LCA in logN — Binary lifting, Video tutorial

Revision en1, by vedhant, 2020-04-11 16:12:54

Hi, I have made a video in which 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)

Happy coding!

Tags lca, #binary-lifting, video lectures


  Rev. Lang. By When Δ Comment
en1 English vedhant 2020-04-11 16:12:54 454 Initial revision (published)