[LeetCode] - Same Tree

Description: Given two binary trees, write a function to check if they are equal or not.

Note: Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

这题没啥可说的，就是递归的检查就可以了。

/** * 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) || (p==null && q!=null) || (p.val!=q.val)) return false;        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);    }}