LeetCode offer 26. 【递归】树的子结构
原题链接
中等
作者:
大明湖的鱼
,
2021-01-27 17:10:14
,
所有人可见
,
阅读 239
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSubStructure(TreeNode* A, TreeNode* B) {
if(A == NULL || B == NULL) return false;
return isSameTree(A,B) || isSubStructure(A->left,B) || isSubStructure(A->right,B);
}
bool isSameTree(TreeNode* p,TreeNode* q){
if(q == NULL) return true;
if(p == NULL) return false;
if(p->val == q->val) return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
else return false;
}
};