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.

二、代码实现

int minDepth(TreeNode* root) {        if(root==NULL)    return 0;if(root->left==NULL)return 1+minDepth(root->right);if(root->right==NULL)return 1+minDepth(root->left);int left=1+minDepth(root->left);int right=1+minDepth(root->right);  return left<right?left:right;    }