We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a51f98a commit d4d471bCopy full SHA for d4d471b
Binary Search Tree/README.markdown
@@ -268,7 +268,7 @@ If there are no more nodes to look at -- when `left` or `right` is nil -- then w
268
Searching is a recursive process, but you can also implement it with a simple loop instead:
269
270
```swift
271
- public func search(value: T) -> BinarySearchTree? {
+ public func search(_ value: T) -> BinarySearchTree? {
272
var node: BinarySearchTree? = self
273
while let n = node {
274
if value < n.value {
0 commit comments