Add solution #1305

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,218 LeetCode solutions in JavaScript
+# 1,219 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -987,6 +987,7 @@
 1301|[Number of Paths with Max Score](./solutions/1301-number-of-paths-with-max-score.js)|Hard|
 1302|[Deepest Leaves Sum](./solutions/1302-deepest-leaves-sum.js)|Medium|
 1304|[Find N Unique Integers Sum up to Zero](./solutions/1304-find-n-unique-integers-sum-up-to-zero.js)|Easy|
+1305|[All Elements in Two Binary Search Trees](./solutions/1305-all-elements-in-two-binary-search-trees.js)|Medium|
 1309|[Decrypt String from Alphabet to Integer Mapping](./solutions/1309-decrypt-string-from-alphabet-to-integer-mapping.js)|Easy|
 1313|[Decompress Run-Length Encoded List](./solutions/1313-decompress-run-length-encoded-list.js)|Easy|
 1317|[Convert Integer to the Sum of Two No-Zero Integers](./solutions/1317-convert-integer-to-the-sum-of-two-no-zero-integers.js)|Easy|

solutions/1305-all-elements-in-two-binary-search-trees.js

@@ -0,0 +1,37 @@
+/**
+ * 1305. All Elements in Two Binary Search Trees
+ * https://leetcode.com/problems/all-elements-in-two-binary-search-trees/
+ * Difficulty: Medium
+ *
+ * Given two binary search trees root1 and root2, return a list containing all the integers from
+ * both trees sorted in ascending order.
+ */
+
+/**
+ * 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
+ * @return {number[]}
+ */
+var getAllElements = function(root1, root2) {
+  const values = [];
+
+  inorder(root1);
+  inorder(root2);
+
+  return values.sort((a, b) => a - b);
+
+  function inorder(node) {
+    if (!node) return;
+    inorder(node.left);
+    values.push(node.val);
+    inorder(node.right);
+  }
+};