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-anc...
Final code https://github.com/Errichto/youtube/b...
Coding live streams - / errichto
FAQ - https://github.com/Errichto/youtube/w...
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.