LeetCode 二叉树 | 100. Same Tree

最新推荐文章于 2020-06-28 09:46:18 发布

rical730

最新推荐文章于 2020-06-28 09:46:18 发布

阅读量235

点赞数

分类专栏： LeetCode 文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/rical730/article/details/59486193

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

/*
 * Leetcode100. Same Tree
 * Funtion: Given two binary trees, write a function to check if they are equal or not.

 * Author: LKJ
 * Date:2016/7/21
 * 找两棵数是不是一样的
*/
#include <iostream>
//#include <vector>

using namespace std;


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 == NULL)&&(q == NULL) ){
            return true;
        }else if( (p != NULL)&&(q == NULL) ){
            return false;
        }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));
            }
        }
    }
};


int main(){
    //int myin;
    //int myout;
    //Solution SA;
    //cout << "Please Enter" << endl;
    //cin >> myin;
    //myout = SA.singleNumber(myin);
    //cout << myout << endl;
    //cout << getFristBit(1) << endl;
    return 0;
}