LeetCode-100. 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.

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

Solution 1(C++)

class Solution {
public:
    bool isSameTree(TreeNode *p, TreeNode *q) {
        if (p == NULL || q == NULL) return (p == q);
        return (p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right));
    }
};

算法分析

每个二叉树分为左子树与右子树，天然的递归···

程序分析

我一直被树的空节点有点搞晕了。其实对于node，只用判断他是不是为空，不为空就可以访问node->left， 与node->right。但如果要访问node->left->val， 或者node->right->val的话，就要判断对应的node->left与node->right是否为空。