 		else if root.children.count == 0 {
 			return false
 		}
+		//searchStr and currEdge have the same functionality as in insert() and find()
 		var searchStr = str
 		var currEdge = root
 		while (true) {

				  	return false
				}
			}
			if !found {
				return false
			}
		}
	}

	func remove(_ str: String) -> Bool {
		//You cannot remove the empty string from the tree
		if str == "" {
			for c in root.children {
				c.erase()

				//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,
				//  break the loop, and run it back
				if shared == c.label {
					currEdge = c
					var tempIndex = searchStr.startIndex
