[Leetcode]101. Symmetric Tree

1440 단어 LeetCode
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
음.아니면 귀착, 아주 쉬운 문제
public class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root==null) return true;
        return isMirror(root.left,root.right);
    }
    public boolean isMirror(TreeNode p, TreeNode q) {
        if(p==null && q==null) return true;
        if(p==null || q==null) return false;
        return (p.val==q.val) && isMirror(p.left,q.right) && isMirror(p.right,q.left);
    }
}

좋은 웹페이지 즐겨찾기