DSA-Java-Leetcode/1367. Linked List in Binary Tree at main · risitadas/DSA-Java-Leetcode · 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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution
{

    public boolean dfs(ListNode head, ListNode curr, TreeNode root)
    {

        if(curr == null)    return true;

        if(root == null)    return false;

        if(curr.val == root.val)
        {
            curr = curr.next;

        }
        else if(head.val == root.val)
        {
            head = head.next;

        }
        else    curr = head;

        return dfs(head, curr , root.left) || dfs(head, curr, root.right);


    }

    public boolean isSubPath(ListNode head, TreeNode root)
    {
        return dfs(head, head, root);

    }


    /*

RUNTIME 1 MS, MEMORY 44.93 MB


    public boolean isContinuousSubPath(ListNode head, TreeNode root)
    {
        if(head == null)    return true;
        if(root == null)    return false;


        return head.val == root.val &&
                    (isContinuousSubPath(head.next, root.left) ||
                    isContinuousSubPath(head.next, root.right));


    }

    public boolean isSubPath(ListNode head, TreeNode root)
    {

        if(root == null) return false;

        return isContinuousSubPath(head, root) || isSubPath(head, root.left) ||
                    isSubPath(head, root.right);


    }


    */

}