Leetcode DFS minimum depth of Binary Tree

Minimum depth of Binary Tree total accepted: 25609 total submissions: 86491my submissions

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.

Obtain the minimum depth of a binary tree.
Ideas:

Mindepth (Root) = 1 + min (mindepth (root-> left), mindepth (root-> right ));

However, if the value of Root-> left or root-> right is null, mindepth returns 0 for them, so the two must be processed separately.

Complexity: time O (N), Space O (log n)

int minDepth(const TreeNode *root){if(!root) return 0;if(!root->left) return 1 + minDepth(root->right);if(!root->right) return 1 + minDepth(root->left);return 1 + min(minDepth(root->left), minDepth(root->right));}

Leetcode DFS minimum depth of Binary Tree