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
Prerequisites
Before reading this article, you should first learn:
For problems like determining if a binary tree is a mirror image or inverting a binary tree, you can generally use the problem decomposition approach. This means breaking down the problem of the entire tree (the original problem) into problems involving its subtrees (subproblems).
