feat: Solution for September Challenge Day 5 - All Elements in Two Binary Search Trees

Author: milanpanchal

Swift/Problems/1305_AllElementsInTwoBinarySearchTrees.playground/Contents.swift

@@ -0,0 +1,102 @@
+/*:
+# 1305. All Elements in Two Binary Search Trees [Medium]
+  https://leetcode.com/problems/all-elements-in-two-binary-search-trees/
+
+ ---
+
+### Problem Statement:
+
+ Given two binary search trees `root1` and `root2`.
+
+ Return a list containing all the integers from both trees sorted in ascending order.
+
+### Example:
+
+ ```
+ 
+    2                1
+   / \              / \
+  /   \            /   \
+ 1     4          0     3
+ 
+ Input: root1 = [2,1,4], root2 = [1,0,3]
+ Output: [0,1,1,2,3,4]
+
+ Input: root1 = [0,-10,10], root2 = [5,1,7,0,2]
+ Output: [-10,0,0,1,2,5,7,10]
+
+ Input: root1 = [], root2 = [5,1,7,0,2]
+ Output: [0,1,2,5,7]
+
+ Input: root1 = [0,-10,10], root2 = []
+ Output: [-10,0,10]
+
+ Input: root1 = [1,null,8], root2 = [8,1]
+ Output: [1,1,8,8]
+
+ ```
+ 
+ ### Constraints:
+ + Each tree has at most 5000 nodes.
+ + Each node's value is between [-10^5, 10^5].
+
+ ### Hint:
+ + Traverse the first tree in list1 and the second tree in list2.
+ + Merge the two trees in one list and sort it.
+
+ */
+
+
+import UIKit
+
+
+// Definition for a binary tree node.
+public class TreeNode {
+    public var val: Int
+    public var left: TreeNode?
+    public var right: TreeNode?
+    public init() { self.val = 0; self.left = nil; self.right = nil; }
+    public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
+    public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
+        self.val = val
+        self.left = left
+        self.right = right
+    }
+}
+
+// 48 / 48 test cases passed.
+// Status: Accepted
+// Runtime: 900 ms
+// Memory Usage: 23.7 MB
+
+class Solution {
+    func getAllElements(_ root1: TreeNode?, _ root2: TreeNode?) -> [Int] {
+        var result = [Int]()
+        inorder(root1, &result)
+        inorder(root2, &result)
+        return result.sorted()
+        
+    }
+    
+    private func inorder(_ root: TreeNode?,_ array: inout [Int]) {
+        guard let root = root else {
+            return
+        }
+        inorder(root.left, &array)
+        array.append(root.val)
+        inorder(root.right, &array)
+    }
+}
+
+let node1 = TreeNode(2)
+node1.left = TreeNode(1)
+node1.right = TreeNode(4)
+
+let node2 = TreeNode(1)
+node2.left = TreeNode(0)
+node2.right = TreeNode(3)
+
+let sol = Solution()
+sol.getAllElements(node1, node2)
+
+

Swift/Problems/1305_AllElementsInTwoBinarySearchTrees.playground/contents.xcplayground

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+<playground version='5.0' target-platform='ios'>
+    <timeline fileName='timeline.xctimeline'/>
+</playground>

Swift/September Challenge/05_AllElementsInTwoBinarySearchTrees.playground/Contents.swift

@@ -0,0 +1,101 @@
+/*:
+# 05. All Elements in Two Binary Search Trees
+  https://leetcode.com/explore/challenge/card/september-leetcoding-challenge/554/week-1-september-1st-september-7th/3449/
+
+ ---
+
+### Problem Statement:
+
+ Given two binary search trees `root1` and `root2`.
+
+ Return a list containing all the integers from both trees sorted in ascending order.
+
+### Example:
+
+ ```
+ 
+    2                1
+   / \              / \
+  /   \            /   \
+ 1     4          0     3
+ 
+ Input: root1 = [2,1,4], root2 = [1,0,3]
+ Output: [0,1,1,2,3,4]
+
+ Input: root1 = [0,-10,10], root2 = [5,1,7,0,2]
+ Output: [-10,0,0,1,2,5,7,10]
+
+ Input: root1 = [], root2 = [5,1,7,0,2]
+ Output: [0,1,2,5,7]
+
+ Input: root1 = [0,-10,10], root2 = []
+ Output: [-10,0,10]
+
+ Input: root1 = [1,null,8], root2 = [8,1]
+ Output: [1,1,8,8]
+
+ ```
+ 
+ ### Constraints:
+ + Each tree has at most 5000 nodes.
+ + Each node's value is between [-10^5, 10^5].
+
+ ### Hint:
+ + Traverse the first tree in list1 and the second tree in list2.
+ + Merge the two trees in one list and sort it.
+
+ */
+
+
+import UIKit
+
+
+// Definition for a binary tree node.
+public class TreeNode {
+    public var val: Int
+    public var left: TreeNode?
+    public var right: TreeNode?
+    public init() { self.val = 0; self.left = nil; self.right = nil; }
+    public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
+    public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
+        self.val = val
+        self.left = left
+        self.right = right
+    }
+}
+
+// 48 / 48 test cases passed.
+// Status: Accepted
+// Runtime: 900 ms
+// Memory Usage: 23.7 MB
+
+class Solution {
+    func getAllElements(_ root1: TreeNode?, _ root2: TreeNode?) -> [Int] {
+        var result = [Int]()
+        inorder(root1, &result)
+        inorder(root2, &result)
+        return result.sorted()
+        
+    }
+    
+    private func inorder(_ root: TreeNode?,_ array: inout [Int]) {
+        guard let root = root else {
+            return
+        }
+        inorder(root.left, &array)
+        array.append(root.val)
+        inorder(root.right, &array)
+    }
+}
+
+let node1 = TreeNode(2)
+node1.left = TreeNode(1)
+node1.right = TreeNode(4)
+
+let node2 = TreeNode(1)
+node2.left = TreeNode(0)
+node2.right = TreeNode(3)
+
+let sol = Solution()
+sol.getAllElements(node1, node2)
+

Swift/September Challenge/05_AllElementsInTwoBinarySearchTrees.playground/contents.xcplayground

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+<playground version='5.0' target-platform='ios'>
+    <timeline fileName='timeline.xctimeline'/>
+</playground>