Binary Lifting (Kth Ancestor of a Tree Node)

Tutorial on binary lifting (also called jump pointers). We find k-th ancestor of a node in O(log(N)). Problem link https://leetcode.com/problems/kth-ancestor-of-a-tree-node/
Final code https://github.com/Errichto/youtube/blob/master/leetcode/1483-kth-ancestor.cpp

Coding live streams - https://www.twitch.tv/errichto
FAQ - https://github.com/Errichto/youtube/wiki/FAQ
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

Видео Binary Lifting (Kth Ancestor of a Tree Node) канала Errichto Algorithms