lina1
diff --git a/‎Binary Tree/BinaryTree.playground/Contents.swift
Lines changed: 9 additions & 9 deletions b/‎Binary Tree/BinaryTree.playground/Contents.swift
Lines changed: 9 additions & 9 deletions
diff --git a/‎Binary Tree/README.markdown
Lines changed: 9 additions & 9 deletions b/‎Binary Tree/README.markdown
Lines changed: 9 additions & 9 deletions
@@ -53,26 +53,26 @@ tree.count  // 12
 
 
 extension BinaryTree {
-  public func traverseInOrder(@noescape process: T -> Void) {
+  public func traverseInOrder(process: (T) -> Void) {
     if case let .Node(left, value, r
10000
ight) = self {
-      left.traverseInOrder(process)
+      left.traverseInOrder(process: process)
       process(value)
-      right.traverseInOrder(process)
+      right.traverseInOrder(process: process)
     }
   }
 
-  public func traversePreOrder(@noescape process: T -> Void) {
+  public func traversePreOrder(process: (T) -> Void) {
     if case let .Node(left, value, right) = self {
       process(value)
-      left.traversePreOrder(process)
-      right.traversePreOrder(process)
+      left.traversePreOrder(process: process)
+      right.traversePreOrder(process: process)
     }
   }
 
-  public func traversePostOrder(@noescape process: T -> Void) {
+  public func traversePostOrder(process: (T) -> Void) {
     if case let .Node(left, value, right) = self {
-      left.traversePostOrder(process)
-      right.traversePostOrder(process)
+      left.traversePostOrder(process: process)
+      right.traversePostOrder(process: process)
       process(value)
     }
   }
 
@@ -111,26 +111,26 @@ Something you often need to do with trees is traverse them, i.e. look at all the
 Here is how you'd implement that:
 
 ```swift
-  public func traverseInOrder(@noescape process: T -> Void) {
+  public func traverseInOrder(process: (T) -> Void) {
     if case let .Node(left, value, right) = self {
-      left.traverseInOrder(process)
+      left.traverseInOrder(process: process)
       process(value)
-      right.traverseInOrder(process)
+      right.traverseInOrder(process: process)
     }
   }
 
-  public func traversePreOrder(@noescape process: T -> Void) {
+  public func traversePreOrder(process: (T) -> Void) {
     if case let .Node(left, value, right) = self {
       process(value)
-      left.traversePreOrder(process)
-      right.traversePreOrder(process)
+      left.traversePreOrder(process: process)
+      right.traversePreOrder(process: process)
     }
   }
 
-  public func traversePostOrder(@noescape process: T -> Void) {
+  public func traversePostOrder(process: (T) -> Void) {
     if case let .Node(left, value, right) = self {
-      left.traversePostOrder(process)
-      right.traversePostOrder(process)
+      left.traversePostOrder(process: process)
+      right.traversePostOrder(process: process)
       process(value)
     }
   }
Original file line number	Diff line number	Diff line change
`@@ -53,26 +53,26 @@ tree.count // 12`
`53`	`53`
`54`	`54`
`55`	`55`	`extension BinaryTree {`
`56`		`- public func traverseInOrder(@noescape process: T -> Void) {`
	`56`	`+ public func traverseInOrder(process: (T) -> Void) {`
`57`	`57`	`if case let .Node(left, value, r 10000 ight) = self {`
`58`		`- left.traverseInOrder(process)`
	`58`	`+ left.traverseInOrder(process: process)`
`59`	`59`	`process(value)`
`60`		`- right.traverseInOrder(process)`
	`60`	`+ right.traverseInOrder(process: process)`
`61`	`61`	`}`
`62`	`62`	`}`
`63`	`63`
`64`		`- public func traversePreOrder(@noescape process: T -> Void) {`
	`64`	`+ public func traversePreOrder(process: (T) -> Void) {`
`65`	`65`	`if case let .Node(left, value, right) = self {`
`66`	`66`	`process(value)`
`67`		`- left.traversePreOrder(process)`
`68`		`- right.traversePreOrder(process)`
	`67`	`+ left.traversePreOrder(process: process)`
	`68`	`+ right.traversePreOrder(process: process)`
`69`	`69`	`}`
`70`	`70`	`}`
`71`	`71`
`72`		`- public func traversePostOrder(@noescape process: T -> Void) {`
	`72`	`+ public func traversePostOrder(process: (T) -> Void) {`
`73`	`73`	`if case let .Node(left, value, right) = self {`
`74`		`- left.traversePostOrder(process)`
`75`		`- right.traversePostOrder(process)`
	`74`	`+ left.traversePostOrder(process: process)`
	`75`	`+ right.traversePostOrder(process: process)`
`76`	`76`	`process(value)`
`77`	`77`	`}`
`78`	`78`	`}`
Original file line number	Diff line number	Diff line change
`@@ -111,26 +111,26 @@ Something you often need to do with trees is traverse them, i.e. look at all the`
`111`	`111`	`Here is how you'd implement that:`
`112`	`112`
`113`	`113`	```swift
`114`		`- public func traverseInOrder(@noescape process: T -> Void) {`
	`114`	`+ public func traverseInOrder(process: (T) -> Void) {`
`115`	`115`	`if case let .Node(left, value, right) = self {`
`116`		`- left.traverseInOrder(process)`
	`116`	`+ left.traverseInOrder(process: process)`
`117`	`117`	`process(value)`
`118`		`- right.traverseInOrder(process)`
	`118`	`+ right.traverseInOrder(process: process)`
`119`	`119`	`}`
`120`	`120`	`}`
`121`	`121`
`122`		`- public func traversePreOrder(@noescape process: T -> Void) {`
	`122`	`+ public func traversePreOrder(process: (T) -> Void) {`
`123`	`123`	`if case let .Node(left, value, right) = self {`
`124`	`124`	`process(value)`
`125`		`- left.traversePreOrder(process)`
`126`		`- right.traversePreOrder(process)`
	`125`	`+ left.traversePreOrder(process: process)`
	`126`	`+ right.traversePreOrder(process: process)`
`127`	`127`	`}`
`128`	`128`	`}`
`129`	`129`
`130`		`- public func traversePostOrder(@noescape process: T -> Void) {`
	`130`	`+ public func traversePostOrder(process: (T) -> Void) {`
`131`	`131`	`if case let .Node(left, value, right) = self {`
`132`		`- left.traversePostOrder(process)`
`133`		`- right.traversePostOrder(process)`
	`132`	`+ left.traversePostOrder(process: process)`
	`133`	`+ right.traversePostOrder(process: process)`
`134`	`134`	`process(value)`
`135`	`135`	`}`
`136`	`136`	`}`