Hello I have a question if I have a tree with n nodes and all nodes have some value there are two types of queries
what is the max node value in the path (u,v)
update u to be equal to x
I think HLD can solve this problem but I want to know if there is other ways or techniques that can solve a problem like this
Thank you
edit:
Why does eveybody keep downvoting I just had a question
You can also use link-cut trees, in my experience they are faster
thank you <3
Auto comment: topic has been updated by AbdoGad (previous revision, new revision, compare).