Flip Equivalent Binary Trees

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.

Write a function that determines whether two binary trees are flip equivalent.  The trees are given by root nodes root1 and root2.

 

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.

 

Note:

1. Each tree will have at most 100 nodes.
2. Each value in each tree will be a unique integer in the range [0, 99].

 

题目理解：

定义flip操作：将某一个节点root的左子树与右子树交换。给定两棵二叉树，判断经过有限次的flip操作，能否让两棵树变得相同

解题思路：

对于某一个节点，如果不交换左右子树，那么就需要root1.left == root2.left && root1.right == root2.right，如果交换左右子树，就需要root1.left == root2.right && root1.right == root2.left，二者满足其一就可以。

这里主要的技巧是使用递归，如果两个节点root1和root2的子树经过flip操作之后相等，那么如果root1.val == root2.val，那么以root1为根节点的二叉树和以root2位根节点的二叉树就相等

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean flipEquiv(TreeNode root1, TreeNode root2) {
        if(root1 == null && root2 == null)
            return true;
        if(root1 == null || root2 == null)
            return false;
        if(root1.val != root2.val)
            return false;
        return flipEquiv(root1.left, root2.left) && flipEquiv(root1.right, root2.right) ||
            flipEquiv(root1.left, root2.right) && flipEquiv(root1.right, root2.left);
    }
}