Move binary tree

Author: igorwojda

README.md

@@ -102,8 +102,8 @@ multiple times and be persistent over time.
 - [Binary search tree](src/test/kotlin/com/igorwojda/tree/binarysearchtree/desc.md)
 - [Tree traversal](src/test/kotlin/com/igorwojda/tree/classic/traversal/desc.md)
 - [Tree level width](src/test/kotlin/com/igorwojda/tree/classic/levelwidth/desc.md)
-- [Binary search tree (insert)](src/test/kotlin/com/igorwojda/binarytree/insert/desc.md)
-- [Binary search tree (validate)](src/test/kotlin/com/igorwojda/binarytree/validate/desc.md)
+- [Binary search tree (insert)](src/test/kotlin/com/igorwojda/tree/binarytree/insert/desc.md)
+- [Binary search tree (validate)](src/test/kotlin/com/igorwojda/tree/binarytree/validate/desc.md)
 - [Any callback](src/test/kotlin/com/igorwojda/various/anycallback/desc.md)
 - [Flatten](src/test/kotlin/com/igorwojda/list/flatten/desc.md)
 - [Binary search](src/test/kotlin/com/igorwojda/list/search/binarysearch/desc.md)

misc/PuzzleGroups.md

@@ -11,7 +11,7 @@ List of problems that can be solved using [recursion](https://en.wikipedia.org/w
 - [Get odd](../src/test/kotlin/com/igorwojda/integer/getodd/desc.md)
 - [Any callback](../src/test/kotlin/com/igorwojda/various/anycallback/desc.md)
 - [Power](../src/test/kotlin/com/igorwojda/integer/power/desc.md)
-- [Binary search tree (validate)](../src/test/kotlin/com/igorwojda/binarytree/validate/desc.md)
+- [Binary search tree (validate)](../src/test/kotlin/com/igorwojda/tree/binarytree/validate/desc.md)
 - [Fibonacci](../src/test/kotlin/com/igorwojda/integer/fibonacci/basic/desc.md)
 - [Fibonacci with recursive cache](../src/test/kotlin/com/igorwojda/integer/fibonacci/recursivecached/desc.md)
 - [Add up to](../src/test/kotlin/com/igorwojda/integer/addupto/desc.md)
@@ -108,8 +108,8 @@ We use sliding window instead of nested loops which decreases complexity from `O
 
 ## Binary tree
 
-- [Binary Search Tree (insert)](../src/test/kotlin/com/igorwojda/binarytree/insert/desc.md)
-- [Binary Tree (validate)](../src/test/kotlin/com/igorwojda/binarytree/validate/desc.md)
+- [Binary Search Tree (insert)](../src/test/kotlin/com/igorwojda/tree/binarytree/insert/desc.md)
+- [Binary Tree (validate)](../src/test/kotlin/com/igorwojda/tree/binarytree/validate/desc.md)
 
 ## Integer
 

src/test/kotlin/com/igorwojda/binarytree/insert/challenge.kt src/test/kotlin/com/igorwojda/tree/binarytree/insert/challenge.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.binarytree.insert
+package com.igorwojda.tree.binarytree.insert
 
 import org.amshove.kluent.shouldBeEqualTo
 import org.junit.jupiter.api.Test

src/test/kotlin/com/igorwojda/binarytree/insert/desc.md src/test/kotlin/com/igorwojda/tree/binarytree/insert/desc.md

@@ -1,4 +1,4 @@
-package com.igorwojda.binarytree.insert
+package com.igorwojda.tree.binarytree.insert
 
 private object Solution1 {
     private data class Node<E : Comparable<E>>(

src/test/kotlin/com/igorwojda/binarytree/insert/solution.kt src/test/kotlin/com/igorwojda/tree/binarytree/insert/solution.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.binarytree.validate
+package com.igorwojda.tree.binarytree.validate
 
 import org.amshove.kluent.shouldBeEqualTo
 import org.amshove.kluent.shouldEqual

src/test/kotlin/com/igorwojda/binarytree/validate/challenge.kt src/test/kotlin/com/igorwojda/tree/binarytree/validate/challenge.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.binarytree.validate
+package com.igorwojda.tree.binarytree.validate
 
 private object Solution1 {
     private fun isValidSearchBinaryTree(node: Node<Int>, min: Int? = null, max: Int? = null): Boolean {