判断两个二叉树是否是相同的二叉树

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

 

package leetcode;

public class Same_tree {
      public static void main(String[] args) {
        
    }
      
      public boolean isSameTree(TreeNode p, TreeNode q) {
          
          if(p == null && q == null) {
              return true;
          }else if(p != null && q != null && p.val == q.val) {
              return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
          }else {
              return false;
          }
          
          
      }
}