(LeetCode 热题 100) 101. 对称二叉树（深度优先搜索dfs）

题目：101. 对称二叉树

方法一：深度优先搜索dfs、递归。

C++版本：

/**
 * 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 dfs(TreeNode * root1,TreeNode * root2){
        if(!root1 && !root2) return true;
        if(!root1 || !root2 || root1->val!=root2->val) return false;
        return (root1->val == root2->val )&& dfs(root1->left,root2->right) && dfs(root1->right,root2->left);
    }
    bool isSymmetric(TreeNode* root) {
        return dfs(root->left,root->right);
    }
};

JAVA版本：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    boolean dfs(TreeNode  root1,TreeNode  root2){
        if(root1==null && root2==null) return true;
        if(root1==null || root2==null || root1.val!=root2.val) return false;
        return (root1.val == root2.val )&& dfs(root1.left,root2.right) && dfs(root1.right,root2.left);
    }
    public boolean isSymmetric(TreeNode root) {
        return dfs(root.left,root.right);
    }
}

方法二：递推。
C++版本：

/**
 * 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 isSymmetric(TreeNode* root) {
        queue<TreeNode *> qu;
        qu.push(root);
        qu.push(root);
        bool flag=true;
        while(qu.size()){
            TreeNode * tmp1=qu.front();
            qu.pop();
            TreeNode * tmp2=qu.front();
            qu.pop();
            if(tmp1==nullptr && tmp2==nullptr) continue;
            if(tmp1==nullptr || tmp2==nullptr  ||tmp1->val!=tmp2->val){
                flag=false;
                break;
            }
            qu.push(tmp1->left);
            qu.push(tmp2->right);
            qu.push(tmp1->right);
            qu.push(tmp2->left);
        }
        return flag;
    }
};

JAVA版本：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        Queue<TreeNode> qu =new LinkedList<>();
        qu.add(root);
        qu.add(root);
        boolean flag=true;
        while(!qu.isEmpty()){
            TreeNode  tmp1=qu.poll();
            TreeNode  tmp2=qu.poll();
            if(tmp1==null && tmp2==null) continue;
            if(tmp1==null || tmp2==null  ||tmp1.val!=tmp2.val){
                flag=false;
                break;
            }
            qu.add(tmp1.left);
            qu.add(tmp2.right);
            qu.add(tmp1.right);
            qu.add(tmp2.left);
        }
        return flag;
    }
}