LeetCode 111. 二叉树的最小深度

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     struct TreeNode *left;
 6  *     struct TreeNode *right;
 7  * };
 8  */
 9 int minDepth(struct TreeNode* root){
10     if(root==NULL) return 0;
11     if(root->left==NULL&&root->right==NULL) return 1;
12     if(root->left==NULL&&root->right!=NULL) return 1+minDepth(root->right);
13     if(root->left!=NULL&&root->right==NULL) return 1+minDepth(root->left);
14     return minDepth(root->left)<minDepth(root->right)?minDepth(root->left)+1:minDepth(root->right)+1;
15 }