[LeetCode][Java]Same Tree

Same Tree

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.

https://leetcode.com/problems/same-tree/

 1 /**
 2  * Definition for binary tree
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public boolean isSameTree(TreeNode p, TreeNode q) {
12             if(p == null && q == null){
13                 return true;
14             }
15             if(p == null && q != null || q == null && p != null || p.val != q.val){
16                 return false;
17             }
18             
19             return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
20     }
21 }