Skip to content

Commit acfd7cb

Browse files
Merge pull request #4561 from aarushk09/master
Update LCT.mdx #2897
2 parents 15a2481 + 0b3caa7 commit acfd7cb

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed

content/6_Advanced/LCT.mdx

+7
Original file line numberDiff line numberDiff line change
@@ -75,6 +75,11 @@ When a node in a splay tree is accessed, a splay operation is performed on the n
7575
title="Link Cut Tree Implementation"
7676
url="https://github.com/bqi343/USACO/blob/master/Implementations/content/graphs%20(12)/Advanced/LCT.h"
7777
/>
78+
<Resource
79+
source="CF"
80+
title="Fully Dynamic Trees Supporting Path/Subtree Aggregates"
81+
url="https://codeforces.com/blog/entry/103726"
82+
/>
7883
</Resources>
7984

8085
A link cut tree is a data structure that uses splay trees to represent a forest of rooted trees and
@@ -101,6 +106,8 @@ Adding an edge or removing an edge between two vertices are standard features of
101106
Checking if there's a path between two nodes is the same as checking if they're part of the same tree.
102107
To check if two nodes are part of the same tree, we can check if the roots of the trees of the two nodes are the same.
103108

109+
### Implementation
110+
104111
<LanguageSection>
105112
<CPPSection>
106113

0 commit comments

Comments
 (0)