##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Dynamic tree queries
Answer LCA queries while the tree changes: ```pseudocode link(u, v) // Add edge cut(u) // Remove edge lca(u, v) // Query LCA
Link-Cut trees handle all operations in $O(\log n)$. Use case: interactive tree problems where structure changes based on queries. Space: $O(n)$.