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
  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
    1. Relevant-node compression
    2. LCA closure
    3. Stack construction
    4. Queries on selected nodes
  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
  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
    1. Relevant-node compression
    2. LCA closure
    3. Stack construction
    4. Queries on selected nodes
  11. 42.11Tree isomorphism intro
Home/DSA/Advanced Tree Algorithms on Graphs/Virtual trees
42.10Intermediate / Advanced4 topics

Virtual trees

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

Relevant-node compression

Explanation coming soon.

42.10.2

LCA closure

Explanation coming soon.

42.10.3

Stack construction

Explanation coming soon.

42.10.4

Queries on selected nodes

Explanation coming soon.

← Previous · 42.09

DSU on tree

Next · 42.11 →

Tree isomorphism intro

On this page

  • Relevant-node compression
  • LCA closure
  • Stack construction
  • Queries on selected nodes