Add solution #1379

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,264 LeetCode solutions in JavaScript
+# 1,265 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1050,6 +1050,7 @@
 1375|[Number of Times Binary String Is Prefix-Aligned](./solutions/1375-number-of-times-binary-string-is-prefix-aligned.js)|Medium|
 1376|[Time Needed to Inform All Employees](./solutions/1376-time-needed-to-inform-all-employees.js)|Medium|
 1377|[Frog Position After T Seconds](./solutions/1377-frog-position-after-t-seconds.js)|Hard|
+1379|[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](./solutions/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.js)|Easy|
 1380|[Lucky Numbers in a Matrix](./solutions/1380-lucky-numbers-in-a-matrix.js)|Easy|
 1389|[Create Target Array in the Given Order](./solutions/1389-create-target-array-in-the-given-order.js)|Easy|
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|

solutions/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.js

@@ -0,0 +1,42 @@
+/**
+ * 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/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} original
+ * @param {TreeNode} cloned
+ * @param {TreeNode} target
+ * @return {TreeNode}
+ */
+var getTargetCopy = function(original, cloned, target) {
+  return traverse(original, cloned);
+
+  function traverse(originalNode, clonedNode) {
+    if (!originalNode) return null;
+    if (originalNode === target) return clonedNode;
+
+    const leftResult = traverse(originalNode.left, clonedNode.left);
+    if (leftResult) return leftResult;
+
+    return traverse(originalNode.right, clonedNode.right);
+  }
+};