From 3388e019b1cc641e95410dc3f28bdfd34f056cfe Mon Sep 17 00:00:00 2001
From: Ayushmaanagarwal1121 <agarwalayushmaan88@gmail.com>
Date: Sat, 8 Jun 2024 22:22:27 +0530
Subject: [PATCH] Create 0117-populating-next-right-pointers-to-each-node-2.md

---
 ...ting-next-right-pointers-to-each-node-2.md | 86 +++++++++++++++++++
 1 file changed, 86 insertions(+)
 create mode 100644 dsa-solutions/lc-solutions/0100-0199/0117-populating-next-right-pointers-to-each-node-2.md

diff --git a/dsa-solutions/lc-solutions/0100-0199/0117-populating-next-right-pointers-to-each-node-2.md b/dsa-solutions/lc-solutions/0100-0199/0117-populating-next-right-pointers-to-each-node-2.md
new file mode 100644
index 000000000..54cccd5cb
--- /dev/null
+++ b/dsa-solutions/lc-solutions/0100-0199/0117-populating-next-right-pointers-to-each-node-2.md
@@ -0,0 +1,86 @@
+---
+id: 117-populating-next-right-pointer-2
+title: Populating Next Right Pointer To Each Node II
+sidebar_label: 0117 Populating Next Right Pointer To Each Node II
+tags:
+  - Java
+  - Python
+  - C++
+description: "Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL."
+---
+
+## Problem Description
+
+Given the root of a binary tree and an integer `targetSum`, return all root-to-leaf paths where the sum of the node values in the path equals `targetSum`. Each path should be returned as a list of node values, and paths are represented as lists of node values.
+
+
+### Examples
+
+**Example 1:**
+
+![LeetCode Problem - Binary Tree](https://assets.leetcode.com/uploads/2019/02/15/117_sample.png)
+```
+Input: root = [1,2,3,4,5,null,7]
+Output: [1,#,2,3,#,4,5,7,#]
+```
+
+**Example 2:**
+
+
+```
+Input: root = []
+Output: []
+```
+
+### Constraints
+
+- The number of nodes in the tree is in the range [0, 6000].
+- $-100 <= Node.val <= 100$
+---
+
+## Solution for Binary Tree Problem
+
+### Intuition And Approach
+
+To find all root-to-leaf paths where the sum equals targetSum, we can use Depth-First Search (DFS). We'll traverse the tree and keep track of the current path and its sum. When a leaf node is reached, we check if the current path's sum equals targetSum. If it does, we add the path to our result list.
+
+<Tabs>
+ <tabItem value="Recursive" label="Recursive">
+
+
+#### Code in Different Languages
+
+<Tabs>
+  <TabItem value="Java" label="Java" default>
+  <SolutionAuthor name="@Vipullakum007"/>
+   ```java
+  private void dfs(TreeNode node, int sum, List<Integer> path, List<List<Integer>> result) { if (node == null) return; path.add(node.val); if (node.left == null && node.right == null && node.val == sum) { result.add(new ArrayList<>(path)); } else { dfs(node.left, sum - node.val, path, result); dfs(node.right, sum - node.val, path, result); } path.remove(path.size() - 1); } 
+    ```
+
+  </TabItem>
+  <TabItem value="Python" label="Python">
+  <SolutionAuthor name="@Vipullakum007"/>
+   ```python
+    class Solution: def pathSum(self, root: TreeNode, targetSum: int) -> List[List[int]]: def dfs(node, current_path, current_sum): if not node: return current_path.append(node.val) current_sum += node.val if not node.left and not node.right and current_sum == targetSum: result.append(list(current_path)) else: dfs(node.left, current_path, current_sum) dfs(node.right, current_path, current_sum) current_path.pop()
+    ```
+
+  </TabItem>
+  <TabItem value="C++" label="C++">
+  <SolutionAuthor name="@Vipullakum007"/>
+   ```cpp
+    void dfs(TreeNode* node, int sum, vector<int>& path, vector<vector<int>>& result) { if (!node) return; path.push_back(node->val); if (!node->left && !node->right && node->val == sum) { result.push_back(path); } else { dfs(node->left, sum - node->val, path, result); dfs(node->right, sum - node->val, path, result); } path.pop_back(); } 
+    ```
+
+  </TabItem>
+</Tabs>
+
+#### Complexity Analysis
+
+- Time Complexity: $O(n)$ where n is the number of nodes in the binary tree.
+- Space Complexity: $O(h)$ where h is the height of the binary tree.
+
+</tabItem>
+</Tabs>
+
+
+---
\ No newline at end of file