Easy solve Under 10 line of code...........🔥🔥🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: 100%\u2705\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```c []\n/**\n * Definition for a binary tree node.\n * struct TreeNode {\n *     int val;\n *     struct TreeNode *left;\n *     struct TreeNode *right;\n * };\n */\nbool flipEquiv(struct TreeNode* root1, struct TreeNode* root2) {\n    // Base cases\n    if (root1 == NULL && root2 == NULL) return true;  // Both trees are empty\n    if (root1 == NULL || root2 == NULL) return false; // One tree is empty, the other is not\n    if (root1->val != root2->val) return false;       // Values of root nodes are different\n\n    // Recursively check both conditions (with flip and without flip)\n    bool no_flip = flipEquiv(root1->left, root2->left) && flipEquiv(root1->right, root2->right);\n    bool flip = flipEquiv(root1->left, root2->right) && flipEquiv(root1->right, root2->left);\n    \n    return no_flip || flip;  // Return true if either condition is satisfied\n}\n```
['Tree', 'Depth-First Search', 'C', 'Binary Tree']