Files
hello-algo/en/codes/kotlin/utils/TreeNode.kt
Yudong Jin 2778a6f9c7 Translate all code to English (#1836)
* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments
2025-12-31 07:44:52 +08:00

69 lines
2.2 KiB
Kotlin

/**
* File: TreeNode.kt
* Created Time: 2024-01-25
* Author: curtishd (1023632660@qq.com)
*/
package utils
/* Binary tree node class */
/* Constructor */
class TreeNode(
var _val: Int // Node value
) {
var height: Int = 0 // Node height
var left: TreeNode? = null // Reference to left child node
var right: TreeNode? = null // Reference to right child node
// For the serialization encoding rules, please refer to:
// https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
// Array representation of binary tree:
// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
// Linked list representation of binary tree:
// /——— 15
// /——— 7
// /——— 3
// | \——— 6
// | \——— 12
// ——— 1
// \——— 2
// | /——— 9
// \——— 4
// \——— 8
/* Deserialize a list into a binary tree: recursion */
companion object {
private fun listToTreeDFS(arr: MutableList<Int?>, i: Int): TreeNode? {
if (i < 0 || i >= arr.size || arr[i] == null) {
return null
}
val root = TreeNode(arr[i]!!)
root.left = listToTreeDFS(arr, 2 * i + 1)
root.right = listToTreeDFS(arr, 2 * i + 2)
return root
}
/* Deserialize a list into a binary tree */
fun listToTree(arr: MutableList<Int?>): TreeNode? {
return listToTreeDFS(arr, 0)
}
/* Serialize a binary tree into a list: recursion */
private fun treeToListDFS(root: TreeNode?, i: Int, res: MutableList<Int?>) {
if (root == null) return
while (i >= res.size) {
res.add(null)
}
res[i] = root._val
treeToListDFS(root.left, 2 * i + 1, res)
treeToListDFS(root.right, 2 * i + 2, res)
}
/* Serialize a binary tree into a list */
fun treeToList(root: TreeNode?): MutableList<Int?> {
val res = mutableListOf<Int?>()
treeToListDFS(root, 0, res)
return res
}
}
}