[leetcode]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

树的层级遍历

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        // 层级遍历
        if(!p && !q) return true;
        if(!p&&q || p&&!q) return false;
        // if (!p || !q) return q == p;
        if(p->val != q->val) return false;
        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
    }
};

发表评论

电子邮件地址不会被公开。 必填项已用*标注