100. 相同的树 https://leetcode.cn/problems/same-tree
100. Same Tree https://leetcode.com/problems/same-tree
101. 对称二叉树 https://leetcode.cn/problems/symmetric-tree
101. Symmetric Tree https://leetcode.com/problems/symmetric-tree
951. 翻转等价二叉树 https://leetcode.cn/problems/flip-equivalent-binary-trees
951. Flip Equivalent Binary Trees https://leetcode.com/problems/flip-equivalent-binary-trees
124. 二叉树中的最大路径和 https://leetcode.cn/problems/binary-tree-maximum-path-sum
124. Binary Tree Maximum Path Sum https://leetcode.com/problems/binary-tree-maximum-path-sum
类似于判断镜像二叉树、翻转二叉树的问题,一般也可以用分解问题的思路,无非就是把整棵树的问题(原问题)分解成子树之间的问题(子问题)。