Tag: DFS
[LeetCode] 1273. Delete Tree Nodes
Solution Do dfs on tree and check on backtracking if sum from children to current node equals to 0, if yes, trim it and its…
Solution Do dfs on tree and check on backtracking if sum from children to current node equals to 0, if yes, trim it and its…
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 | 31 | ||
Copyright © 2020 Huadong Hu