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.
题目大意:
判断两个二叉树是否完全相同。包括他们节点的内容。
代码如下:(递归版)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
/**
* 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) {
bool
childResult;
if
( NULL == p && NULL == q)
return
true
;
if
( NULL != p && NULL != q && p->val == q->val)
{
return
childResult = isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
}
return
false
;
}
};
|
2016-08-07 00:01:38
本文转自313119992 51CTO博客,原文链接:http://blog.51cto.com/qiaopeng688/1835168