leetcode, LC1: 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
相關文章
相關標籤/搜索