PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 42: Advanced Tree Algorithms on Graphs
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
    1. Kth ancestor
    2. Kth node on path
    3. Min/max edge on path
    4. Function composition jumps
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
    1. Kth ancestor
    2. Kth node on path
    3. Min/max edge on path
    4. Function composition jumps
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
Home/DSA/Advanced Tree Algorithms on Graphs/Binary lifting extensions
42.04Intermediate / Advanced4 topics

Binary lifting extensions

Part of Chapter 42: Advanced Tree Algorithms on Graphs.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

42.04.1

Kth ancestor

Explanation coming soon.

42.04.2

Kth node on path

Explanation coming soon.

42.04.3

Min/max edge on path

Explanation coming soon.

42.04.4

Function composition jumps

Explanation coming soon.

← Previous · 42.03

Euler tours

Next · 42.05 →

Tree DP

On this page

  • Kth ancestor
  • Kth node on path
  • Min/max edge on path
  • Function composition jumps