Time: 28 ms (34.1%), Space: 30.7 MB (87.87%) - LeetHub

Author: MishkatIT

1367-linked-list-in-binary-tree/1367-linked-list-in-binary-tree.cpp

@@ -0,0 +1,36 @@
+/**
+ * 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) {
+        if (!root) return false; 
+        return dfs(root, head) || isSubPath(head, root->left) || isSubPath(head, root->right);
+    }
+
+    bool dfs(TreeNode* root, ListNode* head) {
+        if (!head) return true;  
+        if (!root) return false;
+        if (root->val != head->val) return false; 
+
+        return dfs(root->left, head->next) || dfs(root->right, head->next);
+    }
+};