面试题 04.10. 检查子树
题目链接
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/check-subtree-lcci/submissions/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目分析
参考链接:检查子树(递归)
/**
* 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 checkSubTree(TreeNode* t1, TreeNode* t2) {//检查t2是否是t1的子树
if(t2 == nullptr) return true;
if(t1 == nullptr) return false;
//t1 t2 都不为空
if(t1->val == t2->val){
return checkSubTree(t1->left, t2->left) && checkSubTree(t1->right, t2->right);
}else{
//两边的结果取或即可
return checkSubTree(t1->left, t2) || checkSubTree(t1->right, t2);
}
}
};