Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)

Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)

Tag: Tree, Depth-first Search, Breadth-first Search

Difficulty: Easy

/*

111. Minimum Depth of Binary Tree (Easy)

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.

*/
/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root) {
if (!root) return 0;
else if (!root -> left && !root -> right) return 1;
else {
int depth_L, depth_R;
if (root -> left) depth_L = minDepth(root -> left);
else depth_L = INT_MAX;
if (root -> right) depth_R = minDepth(root -> right);
else depth_R = INT_MAX;
return min(depth_L, depth_R) + 1;
}
}
};