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

LeetCode:Same Tree

时间:2016-06-05 11:13:50      阅读:114      评论:0      收藏:0      [点我收藏+]

标签:

Same Tree




Total Accepted: 132356 Total Submissions: 304237 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Hide Tags
 Tree Depth-first Search













c++ code:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
bool isSam;
/*
void preOrder(TreeNode* p, TreeNode* q)
{
    if(!isSam) return;
    if(NULL == p && NULL == q) return;
    if(NULL == p && NULL!= q || NULL != p && NULL== q) 
    {
        isSam = false;
        return;
    }
    if(p->val != q->val)
    {
        isSam = false;
        return;
    }
    preOrder(p->left, q->left);
    preOrder(p->right, q->right);
}
*/
void inOrder(TreeNode* p, TreeNode* q)
{
    if(!isSam) return;
    if(NULL == p && NULL == q) return;
    if(NULL == p && NULL!= q || NULL != p && NULL== q) 
    {
        isSam = false;
        return;
    }
    inOrder(p->left, q->left);
    if(p->val != q->val)
    {
        isSam = false;
        return;
    }
    inOrder(p->right, q->right);
}


class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        isSam = true;
        //preOrder(p,q);
        inOrder(p,q);
        return isSam;
    }
};


LeetCode:Same Tree

标签:

原文地址:http://blog.csdn.net/itismelzp/article/details/51588271

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