LeetCode100 Same Tree 相同树

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

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

Output: false

题源：here；完整实现：here

思路：

通过递归遍历两颗二叉树，当不相同时返回false。代码如下：

bool isSameTree(TreeNode* p, TreeNode* q) {
	if (!q && !p) return true;
	else if (q && p && q->val == p->val){
		return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
	}
	else return false;
}

纪念贴图