Commitf38831a

committed

Updated Minimum Depth of a Binary Tree.java

1 parent6cb7d53 commitf38831aCopy full SHA for f38831a

File tree

+22

-24

lines changed

+22

-24

lines changed

Lines changed: 22 additions & 24 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,31 +14,29 @@`
`14`	`14`	`* }`
`15`	`15`	`*/`
`16`	`16`	`classSolution {`
`17`		`-publicintminDepth(TreeNoderoot) {`
`18`		`-if (root ==null) {`
`19`		`-return0;`
`20`		`- }`
`21`		`-intsteps =1;`
`22`		`-Queue<TreeNode>queue =newLinkedList<>();`
`23`		`-queue.add(root);`
`24`		`-while (!queue.isEmpty()) {`
`25`		`-intsize =queue.size();`
`26`		`-// Level iteration`
`27`		`-while (size-- >0) {`
`28`		`-TreeNoderemoved =queue.remove();`
`29`		`-// Leaf reached`
`30`		`-if (removed.left ==null &&removed.right ==null) {`
`31`		`-returnsteps;`
`32`		`- }`
`33`		`-if (removed.left !=null) {`
`34`		`-queue.add(removed.left);`
	`17`	`+publicintminDepth(TreeNoderoot) {`
	`18`	`+if (root ==null) {`
	`19`	`+return0;`
`35`	`20`	`}`
`36`		`-if (removed.right !=null) {`
`37`		`-queue.add(removed.right);`
	`21`	`+intlevel =1;`
	`22`	`+Queue<TreeNode>queue =newLinkedList<>();`
	`23`	`+queue.add(root);`
	`24`	`+while (!queue.isEmpty()) {`
	`25`	`+intsize =queue.size();`
	`26`	`+while (size-- >0) {`
	`27`	`+TreeNoderemoved =queue.remove();`
	`28`	`+if (removed.left ==null &&removed.right ==null) {`
	`29`	`+returnlevel;`
	`30`	`+ }`
	`31`	`+if (removed.left !=null) {`
	`32`	`+queue.add(removed.left);`
	`33`	`+ }`
	`34`	`+if (removed.right !=null) {`
	`35`	`+queue.add(removed.right);`
	`36`	`+ }`
	`37`	`+ }`
	`38`	`+level++;`
`38`	`39`	`}`
`39`		`- }`
`40`		`-steps++;`
	`40`	`+returnlevel;`
`41`	`41`	`}`
`42`		`-returnsteps;`
`43`		`- }`
`44`	`42`	`}`

Comments

(0)