I made a short video tutorial on Binary Lifting (a cool technique for answering tree related queries) and answering lowest common ancestor queries in O(log(N)) with it. Binary lifting can be used to answer other queries such as path sum, min, max, etc as well.
I explain the version involving an Euler Tour. In my opinion, it is shorter to code than some other versions involving binary search and getting the nodes to the same depth. You don’t need to know what Euler Tours are, I explain that. You just need to have a thorough understanding of DFS.
Here is the video: Binary Lifting