LeetCode 101. 对称二叉树

解题思路

深度优先搜索。

相关代码

/**
 * 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) {
        return isCheck(root,root);
    }

    public boolean isCheck(TreeNode t1,TreeNode t2){
        if(t1==null&&t2==null) return true;
        if(t1==null||t2==null) return false;

        if(t1.val!=t2.val) return false;
        return isCheck(t1.left,t2.right)&&isCheck(t1.right,t2.left);
    }
}