Symmetric Tree recursive java solution


  • 0
    V

    public class Solution {

    public boolean isSymmetric(TreeNode root) {
    
        if(root == null){
            return true;
        }else{
            return isSameTree(root.left, root.right);
        }      
    }
    
    public boolean isSameTree(TreeNode p, TreeNode q) {
        
           if(p == null && q == null){
               return true;
           }
           
          if(p == null && q != null){
              return false;
          }
          if(p != null && q == null){
              return false;
          }
          
          if(p.val == q.val){
              return isSameTree(p.left, q.right) && isSameTree(p.right, q.left);
          }else{
              return false;
          }
    

    }
    }


Log in to reply
 

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