Update Structure (#136)

Author: igorwojda

README.md

@@ -66,7 +66,7 @@ multiple times and be persistent over time.
 - [Power](src/test/kotlin/com/igorwojda/integer/power)
 - [Factorial](src/test/kotlin/com/igorwojda/integer/factorial)
 - [Product](src/test/kotlin/com/igorwojda/list/product)
-- [Capitalize first](src/test/kotlin/com/igorwojda/list/capitalizeFirst)
+- [Capitalize first](src/test/kotlin/com/igorwojda/list/capitalizefirst)
 - [Decapitalize const](src/test/kotlin/com/igorwojda/string/decapitalizeconst)
 - [Longest word](src/test/kotlin/com/igorwojda/string/longestword)
 
@@ -101,8 +101,8 @@ multiple times and be persistent over time.
 - [Get duplicated arguments](src/test/kotlin/com/igorwojda/string/getduplicatedarguments)
 - [Find pair with target average](src/test/kotlin/com/igorwojda/list/pairaverage)
 - [Binary search tree](src/test/kotlin/com/igorwojda/tree/binarysearchtree)
-- [Tree traversal](src/test/kotlin/com/igorwojda/tree/classic/traversal)
-- [Tree level width](src/test/kotlin/com/igorwojda/tree/classic/levelwidth)
+- [Tree traversal](src/test/kotlin/com/igorwojda/tree/multiway/traversal)
+- [Tree level width](src/test/kotlin/com/igorwojda/tree/multiway/levelwidth)
 - [Binary search tree (insert)](src/test/kotlin/com/igorwojda/tree/binarytree/insert)
 - [Binary search tree (validate)](src/test/kotlin/com/igorwojda/tree/binarytree/validate)
 - [Any callback](src/test/kotlin/com/igorwojda/common/anycallback)

misc/ChallengeGroups.md

@@ -16,7 +16,7 @@ List of problems that can be solved using [recursion](https://en.wikipedia.org/w
 - [Fibonacci with recursive cache](../src/test/kotlin/com/igorwojda/integer/fibonacci/recursivecached)
 - [Add up to](../src/test/kotlin/com/igorwojda/integer/addupto)
 - [Is substring](../src/test/kotlin/com/igorwojda/string/issubstring)
-- [Capitalize first](../src/test/kotlin/com/igorwojda/list/capitalizeFirst)
+- [Capitalize first](../src/test/kotlin/com/igorwojda/list/capitalizefirst)
 - [Merge sort](../src/test/kotlin/com/igorwojda/list/sort/mergesort)
 - [Quick sort](../src/test/kotlin/com/igorwojda/list/sort/quicksort)
 
@@ -29,7 +29,7 @@ for recursive call) or change return type (eg. change `List<Int>` to `MutableLis
 - [Get odd](../src/test/kotlin/com/igorwojda/integer/getodd)
 - [Count down](../src/test/kotlin/com/igorwojda/integer/countdown)
 - [Is substring](../src/test/kotlin/com/igorwojda/string/issubstring)
-- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/classic/traversal)
+- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/multiway/traversal)
 
 ## Double pointer 
 
@@ -84,7 +84,7 @@ We use sliding window instead of nested loops which decreases complexity from `O
 
 ### Other list challenges
 
-- [Capitalize First](../src/test/kotlin/com/igorwojda/list/capitalizeFirst)
+- [Capitalize First](../src/test/kotlin/com/igorwojda/list/capitalizefirst)
 - [Flatten](../src/test/kotlin/com/igorwojda/list/flatten)
 - [Chunk](../src/test/kotlin/com/igorwojda/list/chunk)
 - [Max sub-list sum](../src/test/kotlin/com/igorwojda/list/maxsublistsum)
@@ -164,12 +164,12 @@ We use sliding window instead of nested loops which decreases complexity from `O
 
 - [Queue](../src/test/kotlin/com/igorwojda/queue/basic)
 - [Combine two queues](../src/test/kotlin/com/igorwojda/queue/combine)
-- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/classic/traversal)
+- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/multiway/traversal)
 
 ## Stack
 
 - [Stack](../src/test/kotlin/com/igorwojda/stack/basic)
-- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/classic/traversal)
+- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/multiway/traversal)
 
 ## Heap
 
@@ -178,5 +178,5 @@ We use sliding window instead of nested loops which decreases complexity from `O
 ## Tree
 
 - [Binary search tree](../src/test/kotlin/com/igorwojda/tree/binarysearchtree)
-- [Tree level width](../src/test/kotlin/com/igorwojda/tree/classic/levelwidth)
-- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/classic/traversal)
+- [Tree level width](../src/test/kotlin/com/igorwojda/tree/multiway/levelwidth)
+- [Tree traversal](../src/test/kotlin/com/igorwojda/tree/multiway/traversal)

src/test/kotlin/com/igorwojda/list/capitalizeFirst/Challenge.kt src/test/kotlin/com/igorwojda/list/capitalizefirst/Challenge.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.list.capitalizeFirst
+package com.igorwojda.list.capitalizefirst
 
 import org.amshove.kluent.shouldBeEqualTo
 import org.junit.jupiter.api.Test

src/test/kotlin/com/igorwojda/list/capitalizeFirst/README.md src/test/kotlin/com/igorwojda/list/capitalizefirst/README.md

@@ -1,4 +1,4 @@
-package com.igorwojda.list.capitalizeFirst
+package com.igorwojda.list.capitalizefirst
 
 // Kotlin idiomatic solution
 private object Solution1 {

src/test/kotlin/com/igorwojda/list/capitalizeFirst/Solution.kt src/test/kotlin/com/igorwojda/list/capitalizefirst/Solution.kt

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

src/test/kotlin/com/igorwojda/tree/classic/levelwidth/Challenge.kt src/test/kotlin/com/igorwojda/tree/multiway/levelwidth/Challenge.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.tree.classic.levelwidth
+package com.igorwojda.tree.multiway.levelwidth
 
 private object Solution1 {
     private fun levelWidth(tree: Node): List<Int> {

src/test/kotlin/com/igorwojda/tree/classic/levelwidth/README.md src/test/kotlin/com/igorwojda/tree/multiway/levelwidth/README.md

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

src/test/kotlin/com/igorwojda/tree/classic/levelwidth/Solution.kt src/test/kotlin/com/igorwojda/tree/multiway/levelwidth/Solution.kt

@@ -1,4 +1,4 @@
-package com.igorwojda.tree.classic.traversal
+package com.igorwojda.tree.multiway.traversal
 
 private object Solution1 {
     private class BinarySearchTree<E : Comparable<E>> {