Obtain forest out of tree with even number of nodes

Question

I\'m stuck on a code challenge, and I want a hint.

PROBLEM: You are given a tree data structure (without cycles) and are asked to remo

Answer 1

Here's the approach that I used to successfully pass all the test cases.

1. Mark vertex 1 as the root
2. Starting at the current root vertex, consider each child. If the sum total of the child and all of its children are even, then you can cut that edge
3. Descend to the next vertex (child of root vertex) and let that be the new root vertex. Repeat step 2 until you have traversed all of the nodes (depth first search).