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],
return its minimum depth = 2.
求最小的深度，二叉树，这道题目我认为数据是有问题的，所以有176个踩，
c++
class Solution { public: int minDepth(TreeNode* root) { if(root==NULL) return 0; int lmin =0; int rmin =0; if(root->left!=NULL) lmin = minDepth(root->left); if(root->right!=NULL) rmin = minDepth(root->right); if(lmin==0) return rmin+1; if(rmin==0) return lmin+1; return min(lmin,rmin)+1; } };
LeetCode 112 Minimum Depth of Binary Tree
原文：https://www.cnblogs.com/dacc123/p/9245424.html