Leetcode Brush question three: Determine whether two binary trees are the same

The topics are:

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

The binary trees is considered equal if they is structurally identical and the nodes has the same value.

problem-Solving ideas: This topic is also simple recursive operation

The code is:

/** * Definition for Binary tree * public class TreeNode {*     int val, *     TreeNode left, *     TreeNode right; *
   
    treenode (int x) {val = x;} *} */public class Solution {public    boolean issametree (TreeNode p, TreeNode q) {        bo Olean flag = false;        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 false;        Return Issametree (P.left,q.left) &&issametree (p.right,q.right);            }}
   

Leetcode Brush question three: Determine whether two binary trees are the same