Migration to Swift 3

Author: kelvinlauKL

Binary Search Tree/Solution 2/BinarySearchTree.playground/Contents.swift

@@ -2,13 +2,15 @@
 
 // Each time you insert something, you get back a completely new tree.
 var tree = BinarySearchTree.Leaf(7)
-tree = tree.insert(2)
-tree = tree.insert(5)
-tree = tree.insert(10)
-tree = tree.insert(9)
-tree = tree.insert(1)
+tree = tree.insert(newValue: 2)
+tree = tree.insert(newValue: 5)
+tree = tree.insert(newValue: 10)
+tree = tree.insert(newValue: 9)
+tree = tree.insert(newValue: 1)
 print(tree)
 
-tree.search(10)
-tree.search(1)
-tree.search(11)
+tree.search(x: 10)
+tree.search(x: 1)
+tree.search(x: 11)
+
+

Binary Search Tree/Solution 2/BinarySearchTree.playground/Sources/BinarySearchTree.swift

@@ -44,9 +44,9 @@ public enum BinarySearchTree<T: Comparable> {
 
     case .Node(let left, let value, let right):
       if newValue < value {
-        return .Node(left.insert(newValue), value, right)
+        return .Node(left.insert(newValue: newValue), value, right)
       } else {
-        return .Node(left, value, right.insert(newValue))
+        return .Node(left, value, right.insert(newValue: newValue))
       }
     }
   }
@@ -63,17 +63,17 @@ public enum BinarySearchTree<T: Comparable> {
       return (x == y) ? self : nil
     case let .Node(left, y, right):
       if x < y {
-        return left.search(x)
+        return left.search(x: x)
       } else if y < x {
-        return right.search(x)
+        return right.search(x: x)
       } else {
         return self
       }
     }
   }
 
   public func contains(x: T) -> Bool {
-    return search(x) != nil
+    return search(x: x) != nil
   }
 
   /*