Lucid Software SWE interview questions

One very difficult (for me) question, finding the minimum vertex cover of a tree. I wasn't able to figure out the case where the graph is as follows: 1-2-3-4-5-6 The correct vertex cover is {2,5} (len=2), but my greedy and dp approaches would always spit out 3 instead.