DFS traversal
(start)
| 18 | |
| 19 | |
| 20 | def dfs(start): |
| 21 | """DFS traversal""" |
| 22 | # pylint: disable=redefined-outer-name |
| 23 | ret = 1 |
| 24 | visited[start] = True |
| 25 | for v in tree.get(start): |
| 26 | if v not in visited: |
| 27 | ret += dfs(v) |
| 28 | if ret % 2 == 0: |
| 29 | cuts.append(start) |
| 30 | return ret |
| 31 | |
| 32 | |
| 33 | def even_tree(): |