104. 二叉树的最大深度

题目链接：https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/

思路：dfs暴力搜索，一条链一条链的暴搜即可。

上代码：

/**
 * 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 {
    fun maxDepth(root: TreeNode?): Int {
        return if (root == null) {
            0
        } else {
            maxDepth(root.left).coerceAtLeast(maxDepth(root.right)) + 1
        }
    }
}