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.

#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