Upd readme

igorwojda · igorwojda · commit c16f481ad212 · 2023-07-22T23:01:37.000+02:00
diff --git a/src/test/kotlin/com/igorwojda/tree/classic/traversal/Challenge.kt b/src/test/kotlin/com/igorwojda/tree/classic/traversal/Challenge.kt
@@ -98,7 +98,7 @@ private data class BinaryNode<E : Comparable<E>>(
 )
 
 /*
-We can use queue as helper class to implement breath first traversal. This is not the most optimal queue implementation,
+Queue can be used as helper class to implement breath first traversal. This is not the most optimal queue implementation,
 however it's enough for this task. Check "Queue challenge" solution for more details and more efficient queue
 implementation.
 */

Original file line number	Diff line number	Diff line change
`@@ -98,7 +98,7 @@ private data class BinaryNode<E : Comparable<E>>(`
`98`	`98`	`)`
`99`	`99`
`100`	`100`	`/*`
`101`		`-We can use queue as helper class to implement breath first traversal. This is not the most optimal queue implementation,`
	`101`	`+Queue can be used as helper class to implement breath first traversal. This is not the most optimal queue implementation,`
`102`	`102`	`however it's enough for this task. Check "Queue challenge" solution for more details and more efficient queue`
`103`	`103`	`implementation.`
`104`	`104`	`*/`