给定两棵二叉树root1和root2，如果它们可以通过一系列的节点翻转操作变得相等，则返回true，否则返回false。翻转操作是指选择任一节点并交换其左右子树。示例和约束情况见题干描述。
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
A binary tree X is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations.
Given the roots of two binary trees root1 and root2, return true if the two trees are flip equivelent or false otherwise.
Example 1:
Input: root1 = [1,2,3,4,5,6,null,null,null,7,8], root2 = [1,3,2,null,6,4,5,null,null,null,null,8,7]
Output: true
Explanation: We flipped at nodes with values 1, 3, and 5.
Example 2:
Input: root1 = [], root2 = []
Output: true
Example 3:
Input: root1 = [], root2 = [1]
Output: false
Example 4:<
最低0.47元/天 解锁文章
128
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
