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

Same Tree

时间:2015-03-28 13:03:15      阅读:113      评论: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.

#include<iostream>
#include<vector>

using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

bool isSameTree(TreeNode *p, TreeNode *q) {
	if (!p&&!q)
		return true;
	else if (q&&p&&p->val == q->val)
		return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
	else
		return false;
}

Same Tree

标签:二叉树

原文地址:http://blog.csdn.net/li_chihang/article/details/44700533

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