/** * 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, 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): TreeNode? { return listToTreeDFS(arr, 0) } /* Serialize a binary tree into a list: recursion */ private fun treeToListDFS(root: TreeNode?, i: Int, res: MutableList) { 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 { val res = mutableListOf() treeToListDFS(root, 0, res) return res } } }