This animation illustrates the bottom-up dynamic programming approach to solve the "Maximum Independent Set" problem on a tree. For each node, we calculate two values:
[include, exclude] - The maximum value when the node is included or excluded from the set.
We traverse the tree from leaves to root (post-order traversal), computing these values for each node based on its children's values.