1ms Java Code using Recursion


  • 0
    public class Solution {
        public boolean isSymmetric(TreeNode root) {
            if(root==null){
                return true;
            }
            return isSymmetric(root.left, root.right);
        }
        public static boolean isSymmetric(TreeNode t1, TreeNode t2){
            if(t1==null && t2==null){
                return true;
            }
            if(t1==null && t2!=null){
                return false;
            }
            if(t1!=null && t2==null){
                return false;
            }
            return t1.val==t2.val && isSymmetric(t1.left, t2.right) && isSymmetric(t1.right, t2.left);
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.