码迷,mamicode.com
首页 > 其他好文 > 详细

Same Tree

时间:2015-12-17 12:55:12      阅读:119      评论:0      收藏:0      [点我收藏+]

标签:

Same Tree

Total Accepted: 98221 Total Submissions: 232503 Difficulty: Easy

 

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 && !q) return true;
        if(!p || !q) return false;
        if(p->val != q->val) return false;
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    }
};

Same Tree

标签:

原文地址:http://www.cnblogs.com/zengzy/p/5053399.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!