Dynamic Programming Solutions - DPV 6.21 Vertex Cover

Find minimum vertex cover for a tree using dynamic programming in linear time.

Errata : @7:53 P(x, EXC) that the min is unnecessary since we exclude x, we include all the children and sum the include up.

Source code -

Credit and References (uses DFS code from)

[MMGuy]

At 7:53 I believe in P(x, EXC) that the min is unnecessary. Because if we exclude x, we include all the children and sum the include up, there is no min to check