Heavy Light Decomposition | Set 1 (Introduction) - GeeksforGeeks

Heavy Light Decomposition | Set 1 (Introduction) - GeeksforGeeks

Example Problem: Let us understand Heavy-light decomposition (HLD) with the help of below example.

Suppose we have an unbalanced tree (not necessarily a Binary Tree) of n nodes, and we have to perform operations on the tree to answer a number of queries, each can be of one of the two types:

1. change(a, b): Update weight of the a^th edge to b.
2. maxEdge(a, b): Print the maximum edge weight on the path from node a to node b. For example maxEdge(5, 10) should print 25.

Assume that nodes are numbered from 1 to n. There must be n-1 edges. Edge weights are natural numbers. Also assume that both type of queries are interspersed (approximately equal in number), and hence no type can be sidelined to compromise on complexity.

Read full article from Heavy Light Decomposition | Set 1 (Introduction) - GeeksforGeeks