首页 > 其他 > 详细

LeetCode OJ - Same Tree

时间:2014-05-23 12:39:23      阅读:353      评论: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.

解题思路:

递归求解。先判断根,然后递归判断左子树和右子树

代码

bubuko.com,布布扣
 1 /**
 2  * Definition for binary tree
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     bool isSameTree(TreeNode *p, TreeNode *q) {
13         if (p == NULL && q == NULL){
14             return true;
15         }
16         else if (p != NULL && q != NULL && p->val == q->val ){
17             return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
18         } else {
19             return false;
20         }
21     }
22 };
bubuko.com,布布扣

 

LeetCode OJ - Same Tree,布布扣,bubuko.com

LeetCode OJ - Same Tree

原文:http://www.cnblogs.com/dongguangqing/p/3737232.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!