leetcode 111-minimum-depth-of-binary-tree | 二叉树的最小深度

题目链接

https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/

题目解析

Golang

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func minDepth(root *TreeNode) int {
    if root == nil {
        return 0
    }
    leftDepth := minDepth(root.Left)
    rightDepth := minDepth(root.Right)
    if root.Left == nil {
        return 1 + rightDepth
    }else if root.Right == nil {
        return 1 + leftDepth
    }

    return 1 + min(leftDepth,rightDepth)
}

func min(a,b int)int {
    if a < b {
        return a
    } else {
        return b
    }
}