3605d412fb11b92ff47d100cd6910e83
(难度Easy) Problem 100. Same Tree(判断树相等)

Same Tree

Difficulty

Easy

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.

Example 1:

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

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

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

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

Output: false

Example 3:

```
Input: 1 1
/ \ / \
2 1 1 2

top Created with Sketch.