LeetCode_Solutions/#1367. Linked List in Binary Tree.cpp at main · InflixOP/LeetCode_Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isSubPath(ListNode* head, TreeNode* root) {
        return check(head,head,root);
    }
    bool check(ListNode* head,ListNode* curr,TreeNode* root){
        if(!curr)
        return true;
        if(!root)
        return false;
        if(root->val==curr->val){
            curr=curr->next;
        }else if(head->val==root->val){
            head=head->next;
        }else{
            curr=head;
        }
        bool left=false,right=false;
        left=check(head,curr,root->left);
        right=check(head,curr,root->right);
        return left||right;

    }
};