Same Tree

最新推荐文章于 2022-04-02 16:09:18 发布

Nereus_Li

最新推荐文章于 2022-04-02 16:09:18 发布

阅读量554

点赞数

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

本文链接：https://blog.csdn.net/li_chihang/article/details/44700533

版权

LeetCode 专栏收录该内容

113 篇文章 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;
}