Блог пользователя vedhant

Автор vedhant, история, 4 года назад, По-английски

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!

  • Проголосовать: нравится
  • +5
  • Проголосовать: не нравится