Java [Leetcode 100]same Tree

Title Description:

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:

The recursive call compares the Saozi right subtree and the node.

Code Description:

/** * Definition for a binary tree node.  * public class TreeNode {*     int val, *     TreeNode left, *     TreeNode right; *     TreeNode (int x) {val = x;} *} */public class Solution {public    boolean issametree (TreeNode p, TreeNode q) {    if (p = = NULL && q = = null)    return true;    else if (p = = NULL | | q = = NULL)    return false;    else    return p.val = = Q.val && issametree (p.left, Q.left) && issametree (P.right, q.right);}    }

　　

Java [Leetcode 100]same Tree