java solution which understood easily


  • 0
    W

    /**

    • Definition for a binary tree node.

    • public class TreeNode {

    • int val;
      
    • TreeNode left;
      
    • TreeNode right;
      
    • TreeNode(int x) { val = x; }
      
    • }
      */
      class Solution {
      public boolean isSameTree(TreeNode p, TreeNode q)
      {
      boolean res=false;
      if(p==null&&q==null)
      res=true;
      else if(p==null||q==null)
      res=false;
      else if(p.val==q.val)
      res=(isSameTree(p.left,q.left))&&(isSameTree(p.right,q.right));
      else
      res=false;

       return res;
      

      }
      }


Log in to reply
 

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