二叉树(subtree类型题目 leetcode)
1.判断二叉树是否存在路径的值对应链表每个节点的值
//递归实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* 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 isSubPath(ListNode* head, TreeNode* root) {
if(head == nullptr) return true;
//链表头为空值,即返回true
if(root == nullptr) return false;
//二叉树节点为空值,即返回false
return dfs(head,root) || isSubPath(head,root->left) || isSubPath(head,root->right);
//深度搜索,如果以该根节点往下深度搜索匹配没有成功,那么将第一个搜索节点移到根节点的子节点
}
bool dfs(ListNode* head, TreeNode* root){
if(head == nullptr) return true;
//链表头为空值,前面匹配已成功,返回True
if(root == nullptr) return false;
//二叉树节点为空值,但链表不为空,还没有匹配成功,即返回false
if(head->val != root->val) return false;
//匹配不成功,返回false
return dfs(head->next,root->left) || dfs(head->next,root->right);
}
};
2.判断是否为子树
//递归实现
/**
* 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) {
if(t2 == nullptr) return true;
if(t1 == nullptr) return false;
return match(t1,t2) || checkSubTree(t1->left,t2) || checkSubTree(t1->right,t2);
}
bool match(TreeNode* t1,TreeNode* t2){
if(t2 == nullptr) return true;
if(t1 == nullptr) return false;
if(t1->val != t2->val) return false;
return match(t1->left,t2->left) && match(t1->right,t2->right);
}
};
``