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

【leetcode】Same Tree(easy)

时间:2015-04-17 15:23:15      阅读:107      评论:0      收藏:0      [点我收藏+]

标签:

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.

 

思路:太简单!

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

 

【leetcode】Same Tree(easy)

标签:

原文地址:http://www.cnblogs.com/dplearning/p/4434875.html

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