题目
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.
比较两棵树是否相同,递归求解即可。
代码:
/**
* Definition for binary tree
* 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;
if(p!=NULL&&q!=NULL&&p->val==q->val) //递归调用
if(isSameTree(p->left,q->left)&&isSameTree(p->right,q->right))
return true;
return false;
}
};
本博客介绍如何通过递归方式判断两棵二叉树是否结构相同且节点值相等,提供详细代码实现。
1338

被折叠的 条评论
为什么被折叠?



