[LeetCode] 104. Maximum Depth of Binary Tree(Kotlin)

[LeetCode] 104. Maximum Depth of Binary Tree(Kotlin)

• https://leetcode.com/problems/maximum-depth-of-binary-tree/

풀이

/**
 * 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
 * }
 */

import kotlin.math.*

class Solution {
    fun maxDepth(root: TreeNode?): Int {
        if(root == null) return 0
        
        var result = 1 + max(maxDepth(root.left), maxDepth(root.right))
        return result
    }
}