No.273 - LeetCode[951] Flip Equivalent Binary Trees - dfs

左右子树交换，直接dfs匹配

/*
 * @lc app=leetcode id=951 lang=cpp
 *
 * [951] Flip Equivalent Binary Trees
 */

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