Same Tree (Java)

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.

Source

/** * 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) {    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));     }}

Test

    public static void main(String[] args){    TreeNode a = new TreeNode(1);    a.left = new TreeNode(2);    a.right = new TreeNode(2);    TreeNode b = new TreeNode(1);    b.left = new TreeNode(2);    b.right = new TreeNode(3);    System.out.println(new Solution().isSameTree(a,b));    }