Add tree traversal

Author: Romanow

src/main/kotlin/ru/romanow/algorithms/BreadthFirstSearch.kt

@@ -15,6 +15,7 @@ class BreadthFirstSearch {
 
         while (queue.isNotEmpty()) {
             val node = queue.poll()
+            // print("${node.value} ")
             result.add(node.value)
             node.left?.let { queue.add(it) }
             node.right?.let { queue.add(it) }

src/test/kotlin/ru/romanow/algorithms/BinarySearchTreeTest.kt

@@ -7,7 +7,6 @@ import org.junit.jupiter.params.provider.Arguments
 import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class BinarySearchTreeTest {
@@ -16,7 +15,7 @@ class BinarySearchTreeTest {
     @ParameterizedTest(name = "#{index} – Search {1} in tree {0}")
     fun flatten(items: List<Int?>, target: Int, result: Int?) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = BinarySearchTree()
         assertThat(obj.find(root, target)?.value).isEqualTo(result)

src/test/kotlin/ru/romanow/algorithms/BreadthFirstSearchTest.kt

@@ -7,7 +7,6 @@ import org.junit.jupiter.params.provider.Arguments
 import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class BreadthFirstSearchTest {
@@ -16,7 +15,7 @@ class BreadthFirstSearchTest {
     @ParameterizedTest(name = "#{index} – Bfs {0} is {1}")
     fun flatten(items: List<Int?>, result: List<Int>) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = BreadthFirstSearch()
         assertThat(obj.traverse(root)).isEqualTo(result)

src/test/kotlin/ru/romanow/algorithms/InOrderDeepFirstSearchTest.kt

@@ -7,7 +7,6 @@ import org.junit.jupiter.params.provider.Arguments
 import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class InOrderDeepFirstSearchTest {
@@ -16,7 +15,7 @@ class InOrderDeepFirstSearchTest {
     @ParameterizedTest(name = "#{index} – In-order dfs {0} is {1}")
     fun flatten(items: List<Int?>, result: List<Int>) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = InOrderDeepFirstSearch()
         assertThat(obj.traverse(root)).isEqualTo(result)

src/test/kotlin/ru/romanow/algorithms/PostOrderDeepFirstSearchTest.kt

@@ -7,7 +7,6 @@ import org.junit.jupiter.params.provider.Arguments
 import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class PostOrderDeepFirstSearchTest {
@@ -16,7 +15,7 @@ class PostOrderDeepFirstSearchTest {
     @ParameterizedTest(name = "#{index} – Post-order dfs {0} is {1}")
     fun flatten(items: List<Int?>, result: List<Int>) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = PostOrderDeepFirstSearch()
         assertThat(obj.traverse(root)).isEqualTo(result)

src/test/kotlin/ru/romanow/algorithms/PreOrderDeepFirstSearchTest.kt

@@ -7,7 +7,6 @@ import org.junit.jupiter.params.provider.Arguments
 import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class PreOrderDeepFirstSearchTest {
@@ -16,7 +15,7 @@ class PreOrderDeepFirstSearchTest {
     @ParameterizedTest(name = "#{index} – Pre-order dfs {0} is {1}")
     fun flatten(items: List<Int?>, result: List<Int>) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = PreOrderDeepFirstSearch()
         assertThat(obj.traverse(root)).isEqualTo(result)

src/test/kotlin/ru/romanow/medium/DeleteNodeInABalancedSearchTreeTest.kt

@@ -8,7 +8,6 @@ import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildListFromTree
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class DeleteNodeInABalancedSearchTreeTest {
@@ -17,7 +16,7 @@ class DeleteNodeInABalancedSearchTreeTest {
     @ParameterizedTest(name = "#{index} – Tree {0} after removing key {1} is {2}")
     fun deleteNode(values: List<Int?>, key: Int, expectedResult: List<Int?>) {
         val root = buildTreeFromList(values)
-        printTree(root)
+        // printTree(root)
 
         val obj = DeleteNodeInABalancedSearchTree()
         val result = buildListFromTree(obj.deleteNode(root, key))

src/test/kotlin/ru/romanow/medium/FlattenBinaryTreeToLinkedListTest.kt

@@ -8,7 +8,6 @@ import org.junit.jupiter.params.provider.ArgumentsProvider
 import org.junit.jupiter.params.provider.ArgumentsSource
 import ru.romanow.models.buildListFromTree
 import ru.romanow.models.buildTreeFromList
-import ru.romanow.models.printTree
 import java.util.stream.Stream
 
 class FlattenBinaryTreeToLinkedListTest {
@@ -17,7 +16,7 @@ class FlattenBinaryTreeToLinkedListTest {
     @ParameterizedTest(name = "#{index} – Binary tree {0} flatten into {1}")
     fun flatten(items: List<Int?>, result: List<Int>) {
         val root = buildTreeFromList(items)
-        printTree(root)
+        // printTree(root)
 
         val obj = FlattenBinaryTreeToLinkedList()
         obj.flatten(root)