Create 1214-two-sum-bsts.js

Author: everthis

1214-two-sum-bsts.js

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root1
+ * @param {TreeNode} root2
+ * @param {number} target
+ * @return {boolean}
+ */
+const twoSumBSTs = function(root1, root2, target) {
+  if(root1 == null && root2 == null) return false
+  if(root2 == null) return root1.val === target
+  if(root1 == null) return root2.val === target
+  if(root1.val + root2.val === target) return true
+  if(root1.val + root2.val < target) {
+    return twoSumBSTs(root1.right, root2, target) || twoSumBSTs(root1, root2.right, target)
+  } else {
+    return twoSumBSTs(root1.left, root2, target) || twoSumBSTs(root1, root2.left, target)
+  }
+};