mirror of
https://github.com/krahets/hello-algo.git
synced 2026-06-15 22:57:48 +08:00
772183705e
* Add Russian docs site baseline * Add Russian localized codebase * Polish Russian code wording * Update ru code translation. * Update code translation and chapter covers. * Fix pythontutor extraction. * Add README and landing page. * placeholder of profiles * Use figures of English version * Remove chapter paperbook
40 lines
1.0 KiB
Kotlin
40 lines
1.0 KiB
Kotlin
/**
|
|
* File: binary_tree.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_tree
|
|
|
|
import utils.TreeNode
|
|
import utils.printTree
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
/* Инициализация двоичного дерева */
|
|
// Инициализация узла
|
|
val n1 = TreeNode(1)
|
|
val n2 = TreeNode(2)
|
|
val n3 = TreeNode(3)
|
|
val n4 = TreeNode(4)
|
|
val n5 = TreeNode(5)
|
|
// Построить связи между узлами (указатели)
|
|
n1.left = n2
|
|
n1.right = n3
|
|
n2.left = n4
|
|
n2.right = n5
|
|
println("\nИнициализация двоичного дерева\n")
|
|
printTree(n1)
|
|
|
|
/* Вставка и удаление узлов */
|
|
val P = TreeNode(0)
|
|
// Вставить узел P между n1 -> n2
|
|
n1.left = P
|
|
P.left = n2
|
|
println("\nПосле вставки узла P\n")
|
|
printTree(n1)
|
|
// Удалить узел P
|
|
n1.left = n2
|
|
println("\nПосле удаления узла P\n")
|
|
printTree(n1)
|
|
} |