PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 63: Persistence, Dynamic Trees and Specialized Range Structures
← All DSA chapters

Part XI · Chapter 63

Persistence, Dynamic Trees and Specialized Range Structures
  1. 63.01Persistent data structures
  2. 63.02Persistent search
  3. 63.03Li Chao tree
  4. 63.04Segment tree beats
  5. 63.05Link-cut trees
  6. 63.06Euler-tour trees
    1. Dynamic forest representation
    2. Split/merge of Euler tour
    3. Connectivity maintenance
  7. 63.07Wavelet trees/matrices
← All DSA chapters

Part XI · Chapter 63

Persistence, Dynamic Trees and Specialized Range Structures
  1. 63.01Persistent data structures
  2. 63.02Persistent search
  3. 63.03Li Chao tree
  4. 63.04Segment tree beats
  5. 63.05Link-cut trees
  6. 63.06Euler-tour trees
    1. Dynamic forest representation
    2. Split/merge of Euler tour
    3. Connectivity maintenance
  7. 63.07Wavelet trees/matrices
Home/DSA/Persistence, Dynamic Trees and Specialized Range Structures/Euler-tour trees
63.06Advanced / Expert3 topics

Euler-tour trees

Part of Chapter 63: Persistence, Dynamic Trees and Specialized Range Structures.

Outline only

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

63.06.1

Dynamic forest representation

Explanation coming soon.

63.06.2

Split/merge of Euler tour

Explanation coming soon.

63.06.3

Connectivity maintenance

Explanation coming soon.

← Previous · 63.05

Link-cut trees

Next · 63.07 →

Wavelet trees/matrices

On this page

  • Dynamic forest representation
  • Split/merge of Euler tour
  • Connectivity maintenance