Skip to content

Minimum Depth Of A Binary Tree #192

@vinayassrao

Description

@vinayassrao

This Problem is used to find the minimum depth in a binary tree using level order traversal .

Minimum depth ::-- It is the number of nodes along the shortest path from the root node down to the nearest leaf node.

The language used will be C++
Kindly assign this issue to me.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions