Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given a binary tree, find its minimum depth.

**Example 1:**

Input:1 / \ 3 2 / 4Output:2Explanation:Minimum depth is between nodes 1 and 2 since minimum depth is defined as the number of nodes along the shortest path from the root node down to the nearest leaf node.

**Example 2:**

Input:10 / \ 20 30 \ \ 40 60 / 2Output:3Explanation:Minimum depth is between nodes 10,20 and 40.

**Your Task: **

You don't need to read input or print anything. Complete the function **minDepth()** which takes the root node as an input parameter and returns the minimum depth.

**Expected Time Complexity: **O(N)

**Expected Auxiliary Space: **O(height of the tree)

**Constraints:**

1 ≤ N ≤ 10^5

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Minimum Depth of a Binary Tree

...