Completed Trees-3

Problem_1.py

@@ -0,0 +1,22 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def pathSum(self, root, targetSum):
+        self.result = []
+        self.helper(root, targetSum, 0, [])
+        return self.result
+
+    def helper(self, root, targetSum, currSum, temp):
+        if not root:
+            return
+        temp.append(root.val)
+        currSum = currSum + root.val
+        if not root.left and not root.right and currSum == targetSum:
+            self.result.append(list(temp))
+        self.helper(root.left, targetSum, currSum, temp)
+        self.helper(root.right, targetSum, currSum, temp)
+        temp.pop()

problem_2.py

@@ -0,0 +1,19 @@
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+class Solution:
+    def isSymmetric(self, root):
+        return self.helper(root.left, root.right)
+
+    def helper(self, left, right):
+        if not left or not right:
+            return left == right
+
+        if left.val != right.val:
+            return False
+
+        return self.helper(left.left, right.right) and self.helper(
+            left.right, right.left
+        )