leetcode-111. 二叉树最小深度 · Tree + 递归

 1 class Solution {
 2 public:
 3     int minDepth(TreeNode* root) {
 4         if(root == nullptr)
 5             return 0;
 6         if(root->left && root->right)
 7             return min(getDepth(root->left, 1), getDepth(root->right, 1));
 8         else
 9             return max(getDepth(root->left, 1), getDepth(root->right, 1));
10     }
11     
12     int getDepth(TreeNode* p, int deep)
13     {
14         if(p == nullptr)
15             return deep;
16         if(p->left && p->right)
17             return min(getDepth(p->left, deep+1), getDepth(p->right, deep+1));
18         else
19             return max(getDepth(p->left, deep+1), getDepth(p->right, deep+1));
20     }
21 };