g1601_1700.s1609_even_odd_tree.Solution.kt Maven / Gradle / Ivy

Go to download

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.30

package g1601_1700.s1609_even_odd_tree

// #Medium #Breadth_First_Search #Tree #Binary_Tree
// #2023_06_15_Time_497_ms_(100.00%)_Space_72.4_MB_(50.00%)

import com_github_leetcode.TreeNode

/*
 * Example:
 * var ti = TreeNode(5)
 * var v = ti.`val`
 * Definition for a binary tree node.
 * class TreeNode(var `val`: Int) {
 *     var left: TreeNode? = null
 *     var right: TreeNode? = null
 * }
 */
class Solution {
    private val comp: MutableList = ArrayList()

    fun isEvenOddTree(root: TreeNode?): Boolean {
        return find(root, 0)
    }

    private fun find(root: TreeNode?, height: Int): Boolean {
        if (root == null) {
            return true
        }
        if (height % 2 == 0 && root.`val` % 2 == 0 || height % 2 == 1 && root.`val` % 2 == 1) {
            return false
        }
        if (comp.size == height) {
            comp.add(root.`val`)
        } else {
            if (height % 2 == 0) {
                if (comp[height] >= root.`val`) {
                    return false
                } else {
                    comp[height] = root.`val`
                }
            } else {
                if (comp[height] <= root.`val`) {
                    return false
                } else {
                    comp[height] = root.`val`
                }
            }
        }
        return find(root.left, height + 1) && find(root.right, height + 1)
    }
}