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

leetcode 100. Same Tree

时间:2015-02-17 17:38:02      阅读:111      评论: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.

[Solution]

递归判断val是否相等.

 1 bool isSameTree(TreeNode *p, TreeNode *q) 
 2     {
 3         if (p == NULL || q == NULL)
 4         {
 5             if (p == q)
 6                 return true;
 7             else 
 8                 return false;
 9         }
10         else
11         {
12             if (p->val == q->val)
13                 return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
14             else
15                 return false;
16         }
17     }

 

leetcode 100. Same Tree

标签:

原文地址:http://www.cnblogs.com/ym65536/p/4295351.html

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