Module cd0111_minimum_depth_of_binary_tree

Minimum Depth of Binary Treeleetcode: minimum_depth_of_binary_tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

example: Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its depth = 2.

Structs

TreeNode

Functions

min_depth

Solutions