【LeetCode】100.Same Tree(Easy)解题报告

【LeetCode】100.Same Tree(Easy)解题报告

题目地址：https://leetcode.com/problems/same-tree/description/
题目描述：

  Given two binary trees, write a function to check if they are the same or not.
  Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example1:
Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true
Example2:
Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false
Example3:
Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
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);
        }
    }
}

Date：2017年12月10日