Day 2 challenge

Author: ramanaditya

leetcode/README.md

@@ -333,7 +333,9 @@
     | 987. | <span style="color:orange">Medium</span> | [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/master/leetcode/tree/vertical-order-traversal-of-a-binary-tree.py) |
     | 1022. | <span style="color:green">Easy</span> | [Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/master/leetcode/tree/sum-of-root-to-leaf-binary-numbers.py) |
     | 1305. | <span style="color:orange">Medium</span> | [All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/master/leetcode/tree/all-elements-in-two-binary-search-trees.py) |
+    | 1379. | <span style="color:orange">Medium</span> | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/master/leetcode/tree/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.py) |
 
+
 - ### **April LeetCoding Challenge : 2020**
 
     | Day | Sl No.| Level | Questions | Solution |
@@ -435,4 +437,4 @@
     | Day | Sl No.| Level | Questions | Solution |
     | :---: | :---: | :---: | :--- | :--- |
     | 1 | 1640. | <span style="color:green">Easy</span> | [Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/blob/master/leetcode/array/check-array-formation-through-concatenation.py) |
-    
+    | 2 | 1379. | <span style="color:orange">Medium</span> | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [Python](https://github.com/ramanaditya/data-structure-and-algorithms/tree/master/leetcode/tree/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.py) |

leetcode/tree/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.py

@@ -0,0 +1,73 @@
+"""
+MEDIUM
+1379. [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)
+
+Given two binary trees original and cloned and given a reference to a node target in the original tree.
+
+The cloned tree is a copy of the original tree.
+
+Return a reference to the same node in the cloned tree.
+
+Note that you are not allowed to change any of the two trees or the target node and the answer must be a reference to a
+node in the cloned tree.
+
+Follow up: Solve the problem if repeated values on the tree are allowed.
+
+Example 1:
+Input: tree = [7,4,3,null,null,6,19], target = 3
+Output: 3
+Explanation: In all examples the original and cloned trees are shown. The target node is a green node from the original
+tree. The answer is the yellow node from the cloned tree.
+
+Example 2:
+Input: tree = [7], target =  7
+Output: 7
+
+Example 3:
+Input: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
+Output: 4
+
+Example 4:
+Input: tree = [1,2,3,4,5,6,7,8,9,10], target = 5
+Output: 5
+
+Example 5:
+Input: tree = [1,2,null,3], target = 2
+Output: 2
+
+Constraints:
+The number of nodes in the tree is in the range [1, 10^4].
+The values of the nodes of the tree are unique.
+target node is a node from the original tree and is not null.
+"""
+
+
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+
+class Solution:
+    def getTargetCopy(
+        self, original: TreeNode, cloned: TreeNode, target: TreeNode
+    ) -> TreeNode:
+        def inorder(root, target):
+            stack = []
+            while root is not None or len(stack) > 0:
+                while root is not None:
+                    stack.append(root)
+                    root = root.left
+                root = stack.pop()
+                if root.val == target.val:
+                    return root
+                root = root.right
+            return
+
+        return inorder(cloned, target)
+
+
+# Runtime       : 612 ms, faster than 83.77% of Python3 online submissions
+# Memory Usage  : 24.1 MB, less than 43.70% of Python3 online submissions