Versions Compared

Old Version 1

changes.mady.by.user Chun Kang

Saved on

compared with

New Version 2

changes.mady.by.user Chun Kang

Saved on

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

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.
Flipped Trees Diagram

Image Added

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].

...

Solution in C++

Code Block
/**
 * 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:
    int ChildSum(TreeNode *node) {
        if (!node) return 0;

        int sum=0;
        if (node->left) sum += node->left->val;
        if (node->right) sum += node->right->val;
        return sum;
    }

    int ChildVal(TreeNode *node) {
        if (node) return node->val;
        return 0;
    }

    bool flipEquiv(TreeNode* root1, TreeNode* root2) {
        if (!root1 && !root2) return true;
        if (ChildVal(root1) != ChildVal(root2)) return false;
        if (ChildSum(root1)!=ChildSum(root2)) return false;

        if (root1->left) {
            if (root2->left && ChildVal(root1->left)==ChildVal(root2->left))
                return flipEquiv(root1->left, root2->left) && flipEquiv(root1->right, root2->right);
            else
                return flipEquiv(root1->left, root2->right) && flipEquiv(root1->right, root2->left);
        }
        else if (root1->right) {
            if (root2->right && ChildVal(root1->right)==ChildVal(root2->right))
                return flipEquiv(root1->right, root2->right) && flipEquiv(root1->left, root2->left);
            else
                return flipEquiv(root1->right, root2->left) && flipEquiv(root1->left, root2->right);
        }
        return true;
    }
};