判断二叉树是否可通过翻转部分节点后相同 递归很好写,主要学习一下迭代的写法 https://leetcode.com/problems/flip-equivalent-binary-trees/discuss/200514/JavaPython-3-DFS-3-liners-and-BFS-with-explanation-time-and-space%3A-O(n).