RediOne1/Tree-Data-Structure
1
0
Fork 0
mirror of https://github.com/AdrianKuta/Tree-Data-Structure.git synced 2025-12-31 20:24:55 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

4: Implement Level-order traversal algorithm (#17)

Browse Source
This commit is contained in:
Adrian Kuta
2022-12-16 19:00:25 +01:00
committed by GitHub
parent b69e838a8a
commit 5dd586f9af
6 changed files with 162 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
src/commonTest/kotlin/com.github.adriankuta/TreeNodeTest.kt
View File

@@ -177,4 +177,52 @@ class TreeNodeTest {
val expectedPreOrder = listOf("E", "B", "C", "F", "G", "H", "I", "J", "D", "A")
assertContentEquals(expectedPreOrder, tree.toList().map { it.toString() })
}
@Test
fun secondPostOrderIteratorTest() {
val tree = tree(1, TreeNodeIterators.PostOrder) {
child(2) {
child(5) {
child(10)
}
child(6) {
child(11)
child(12)
child(13)
}
}
child(3)
child(4) {
child(7)
child(8)
child(9)
}
}
val expectedOrder = listOf(10, 5, 11, 12, 13, 6, 2, 3, 7, 8, 9, 4, 1)
assertContentEquals(expectedOrder, tree.toList().map { it.value })
}
@Test
fun levelOrderIteratorTest() {
val tree = tree(1, TreeNodeIterators.LevelOrder) {
child(2) {
child(5) {
child(10)
}
child(6) {
child(11)
child(12)
child(13)
}
}
child(3)
child(4) {
child(7)
child(8)
child(9)
}
}
val expectedOrder = listOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
assertContentEquals(expectedOrder, tree.toList().map { it.value })
}
}