Java solution


  • 0
    E

    Java solution

    /**

    • 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) {
      if(p==null&&q==null) return true;

       if((p!=null)&&(q!=null)&&(p.val==q.val)){
           return (isSameTree(p.left,q.left)&&isSameTree(p.right,q.right));
       }
       return false;
      

      }

    }


Log in to reply
 

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