LeetCode-NOTES/Algorithms/101.Symmetric-Tree/solution.cpp at master · mkn-root12/LeetCode-NOTES · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution
{
public:
    bool dfs(TreeNode *left,TreeNode *right)
    {
        if(!left && !right)
            return true;
        if((left && !right) || (!left && right) || (left->val!=right->val))
            return false;
        return dfs(left->left,right->right) && dfs(left->right,right->left);
    }

    bool isSymmetric(TreeNode *root)
    {
        if(root==NULL || (!root->left && !root->right))
            return true;
        return dfs(root->left,root->right);
    }
};