Media Summary: In this video, I provide a crisp and clear explanation of the concept of Algorithms and data structures. Semester 2. Lecture 9. In the ninth lecture, we started talking about queries on trees. 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 ...
Binary Lifting Dynamic Programming On - Detailed Analysis & Overview
In this video, I provide a crisp and clear explanation of the concept of Algorithms and data structures. Semester 2. Lecture 9. In the ninth lecture, we started talking about queries on trees. 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 ... My coding profiles: Codeforces(Rated, 2092): Codechef(Rated, 2177): ... This week's episode will cover how to find LCAs (least common ancestors) quickly in rooted trees using Learn how to efficiently find the Kth ancestor of a node in a tree using the
Watch video at 1.25x for better experience. Before watching the video, you should try out the below mentioned questions. Don't be ...
