com_github_leetcode.TreeNode.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

package com_github_leetcode

import java.util.LinkedList
import java.util.Queue

class TreeNode {
    var `val`: Int
    var left: TreeNode? = null
    var right: TreeNode? = null

    constructor(`val`: Int) {
        this.`val` = `val`
    }

    constructor(`val`: Int, left: TreeNode?, right: TreeNode?) {
        this.`val` = `val`
        this.left = left
        this.right = right
    }

    override fun toString(): String {
        return if (left == null && right == null) {
            "" + `val`
        } else {
            val root = "" + `val`
            var leftValue = "null"
            var rightValue = "null"
            if (left != null) {
                leftValue = left.toString()
            }
            if (right != null) {
                rightValue = right.toString()
            }
            "$root,$leftValue,$rightValue"
        }
    }

    companion object {
        fun create(treeValues: List): TreeNode? {
            val root = if (treeValues.isEmpty()) null else TreeNode(treeValues[0]!!)
            val queue: Queue = LinkedList()
            queue.offer(root)
            var i = 1
            while (i < treeValues.size) {
                val curr = queue.poll()
                if (treeValues[i] != null) {
                    curr!!.left = TreeNode(treeValues[i]!!)
                    queue.offer(curr.left)
                }
                if (++i < treeValues.size && treeValues[i] != null) {
                    curr!!.right = TreeNode(treeValues[i]!!)
                    queue.offer(curr.right)
                }
                i++
            }
            return root
        }
    }
}