Leetcode-951 Flip Equivalent Binary Trees_leetcode 951 flip equivalent binary trees (分治)-CSDN博客

本文链接：https://blog.csdn.net/Andreadyx/article/details/101309818

951. Flip Equivalent Binary Trees

Medium

32413FavoriteShare

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:

Note:

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

经过昨天上一道题的启发，一开始就想到了用递归。

很快就做出来了

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool flipEquiv(TreeNode* root1, TreeNode* root2) {
        if(root1==NULL && root2==NULL){
            return true;
        }
        if(root1==NULL && root2!=NULL){
            return false;
        }
        if(root1!=NULL && root2==NULL){
            return false;
        }
        if(root1->val == root2->val){
            if(flipEquiv(root1->right,root2->left)&&flipEquiv(root1->left,root2->right)){
                return 1;
            }
            else if(flipEquiv(root1->right,root2->right)&&flipEquiv(root1->left,root2->left)){
                return 1;
            }
            else{
                return false;
            }
            
        }
        else{
            return false;
        }
    }
};