We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 1702f5f commit 90c47cfCopy full SHA for 90c47cf
111. Minimum Depth of Binary Tree.cpp
@@ -53,6 +53,7 @@ class Solution {
53
{
54
depth++;
55
width = q.size();
56
+ //width is used to clear all nodes in one layer
57
for ( int i = 0; i < width; i++ )
58
59
temp = q.front();
0 commit comments