Update solutions/advanced/spoj-cot.mdx

Co-authored-by: envyaims <[email protected]>

solutions/advanced/spoj-cot.mdx

@@ -8,7 +8,7 @@ author: Nigar Hajiyeva
 
 In this code, a persistent segment tree is built for each node in the tree by modifying that of its parent.
 
-Each persistent segment tree keeps the frequency of numbers on the way from the root node to itself. When asked for the kth minimum node in the path of u to v, the code first determines the lowest common ancestor (LCA). Next, we run a binary search using the frequency values from the persistent segment tree of the three nodes.
+Each persistent segment tree keeps the frequency of numbers on the way from the root of the tree given in the input to itself. When asked for the kth minimum node in the path of u to v, the code first determines the lowest common ancestor (LCA) of the tree in the input. Next, we run a binary search using the frequency values from the persistent segment tree of the three nodes.
 
 <LanguageSection>
 <CPPSection>