Solving Minimum Depth of Binary Tree in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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.

Example:

        3
   / \
  9  20
    /  \
   15   7

See the full details of the problem Minimum Depth of Binary Tree at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go