 					found = true
 					break
 				}
-				//If the shared string is empty, go to the next children
+				//If the shared string is empty, go to the next child
 				else if shared.characters.count == 0 {
 					continue
 				}

				//If that is not true, find the shared string b/t the search string
				//  and the label
				var shared = sharedPrefix(searchStr, c.label)
				//If the shared string is equal to the label, update the curent node
				//  and run it back
				if shared == c.label {
					currEdge = c
					var tempIndex = searchStr.startIndex

		}
	}

	//Prints the tree by calling the root's print function
	func printTree() {
		root.printRoot()
	}
