algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Prepare 1.1.0 release (#1274)

Browse Source 
* Update bucket_sort.c

* Fix the comments in quick_sort.c

* Update the announce badge

* Sync zh and zh-hant versions

* Update contributors list.

* Sync zh and zh-hant versions.

* Sync zh and zh-hant versions.

* Update the contributors list

* Update the version number
This commit is contained in:
Yudong Jin
2024-04-14 20:46:20 +08:00
committed by GitHub
parent 16942dfe32
commit d484b08c15
43 changed files with 471 additions and 115 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
zh-hant/codes/kotlin/chapter_tree/array_binary_tree.kt
View File

@ -10,7 +10,6 @@ import utils.TreeNode
import utils.printTree
/* 陣列表示下的二元樹類別 */
/* 建構子 */
class ArrayBinaryTree(private val tree: MutableList<Int?>) {
/* 串列容量 */
fun size(): Int {
@ -93,7 +92,7 @@ class ArrayBinaryTree(private val tree: MutableList<Int?>) {
/* Driver Code */
fun main() {
// 初始化二元樹
// 這裡藉助了一個從陣列直接生成二元樹的函式
// 這裡藉助了一個從串列直接生成二元樹的函式
val arr = mutableListOf(1, 2, 3, 4, null, 6, 7, 8, 9, null, null, 12, null, null, 15)
val root = TreeNode.listToTree(arr)