Open vinayassrao opened 2 years ago
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.
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.