      Traverses the SortedDictionary, looking for a key matches.
      - Parameter for key: A Key type.
      - Parameter node: A RedBlackNode<Key, Value>.
-     - Parameter dictionary: A SortedDictionary<Key, Value> to map the results too.
-     */
-	internal func traverse(for key: Key, node: RedBlackNode<Key, Value>, dictionary: inout SortedDictionary<Key, Value>) {
+     - Parameter dictionary: A SortedDictionary to map the results too.
+     */
+	internal func traverse(for key: Key, node: RedBlackNode<Key, Value>, dictionary: inout SortedDictionary) {
         guard tree.sentinel !== node else {
             return
         }

    /**
     Searches for given keys in the SortedDictionary.
     - Parameter for keys: An Array of Key types.
     - Returns: A SortedDictionary<Key, Value>.
     */
    public func search(for keys: [Key]) -> SortedDictionary<Key, Value> {
		var d = SortedDictionary<Key, Value>()

		self.init()
        insert(elements)
	}
    
    fileprivate init(tree : RedBlackTree<Key, Value>) {
        self.init()
        self.tree = tree
    }
	
	public func makeIterator() -> Iterator {
    var i = indices.makeIterator()
    return AnyIterator { i.next().map { self[$0] } }
	}
