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
    1. Naive parent climbing
    2. Depth alignment
    3. Binary lifting
    4. Euler tour + RMQ
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  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
    1. Naive parent climbing
    2. Depth alignment
    3. Binary lifting
    4. Euler tour + RMQ
  2. 42.02Tree distances and paths
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  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/LCA fundamentals
42.01Intermediate / Advanced4 topics

LCA fundamentals

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.01.1

Naive parent climbing

Explanation coming soon.

42.01.2

Depth alignment

Explanation coming soon.

42.01.3

Binary lifting

Explanation coming soon.

42.01.4

Euler tour + RMQ

Explanation coming soon.

← Previous · 41.08

Spectral and random walks

Next · 42.02 →

Tree distances and paths

On this page

  • Naive parent climbing
  • Depth alignment
  • Binary lifting
  • Euler tour + RMQ