Leetcode 100. Same Tree 验证树是否相同 解题报告

1 解题思想

这道题就是说给了两个二叉树，判断他们是否一样（就是树的结构和值）

这题是在很简单，直接按照相同的方式遍历一下就好，随便你用什么顺序

2 原题

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.

3 AC解

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