[Leedcode 100] Same Tree

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.

/*** Definition for a binary tree node. * public class TreeNode {* int val; * TreeNode left; * TreeNode rig Ht * TreeNode (int x) {val = x;} }*/ Public classSolution { Public BooleanIssametree (TreeNode p, TreeNode q) {//recursive thinking is very simple, first determine the root node, and then judge the left and right nodes respectively//recursive termination conditions are important and must be empty at the same time        if(p==NULL)returnq==NULL; if(q==NULL)return false; if(P.val!=q.val)return false; returnIssametree (P.left,q.left) &&Issametree (p.right,q.right); }}

[Leedcode 100] Same Tree