Symmetric Tree

来源：互联网发布：2013知乎年度吐槽精选编辑：程序博客网时间：2024/04/30 14:16

Solution 1: 递归

/** * Definition for binary tree * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public boolean isSymmetric(TreeNode root) {        if(null == root) return true;        else return isSymmetric(root.left, root.right);    }    public boolean isSymmetric(TreeNode left, TreeNode right){        if(left==null || right==null)            return left==right;        else return (left.val == right.val) && isSymmetric(left.left, right.right)                && isSymmetric(left.right, right.left);    }}

0 0