I have lately learned how to use the LCA algorithm.
I am now wondering whether HLD can be used to solve problems that LCA can't solve or not?
What are your thoughts?
Thanks
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 166 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I have lately learned how to use the LCA algorithm.
I am now wondering whether HLD can be used to solve problems that LCA can't solve or not?
What are your thoughts?
Thanks
Name |
---|
Good day to you,
Well in my opinion this is hardly answered, since LCA is more-like "problem" than algorithm (or group of algorithms), which can be solved with multiple algorithms, such as: HLD, Binary Lifting, EulerTourTree+SparseTable, Tarjan, DP, simple dfs and so on.
Probably each of them has some draw-backs/advantages.
So more-like: HLD is a kind of "LCA algorithms".
The big advantage of HLD is, that is can easily divide the tree, so one can "dynamicaly update" with decent access time [+ it is easy to grapple many structures to the decomposed tree].
Also — it can be (unlike some other LCA algorithms) used in opposite way: to "write" an information to multiple nodes "at once" [like in segment tree ... or well, basically with usage of segment tree {or similar} :) ]
Have Nice Day & Good Luck ^_^