1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

// @Title: 二叉树的深度 (二叉树的深度 LCOF)
// @Author: 15816537946@163.com
// @Date: 2022-02-17 00:59:49
// @Runtime: 4 ms
// @Memory: 4.1 MB
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func maxDepth(root *TreeNode) int {
    var dfs func(*TreeNode,int)
    var ret int
    dfs = func(node *TreeNode,level int) {
        if node == nil {
            if level > ret {
                ret = level
            }
            return
        }
        dfs(node.Left,level+1)
        dfs(node.Right,level+1)
    }

    dfs(root,0)
    return ret

}