vinacky

小菜菜

100. Same Tree

二十八号的。。。

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(p==NULL&&q==NULL)
            return true;
        if(p==NULL)
            return false;
        if(q==NULL)
            return false;
        if(p->val!=q->val)
            return false;
        bool t1,t2;
        t1=isSameTree(p->left,q->left);
        t2=isSameTree(p->right,q->right);
        if(t1==false||t2==false)
            return false;
        return true;
    }
};


阅读更多
个人分类: leetcode
上一篇237. Delete Node in a Linked List
下一篇leetcode 242. Valid Anagram
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭