Binary Tree/Minimum Depth of N-ary Tree/mindepth.cpp at main - skully-coder/competitiveprogramming

main

competitiveprogramming

A

Binary Tree\Minimum Depth of N-ary Tree\mindepth.cpp

5 Complexity
2.5 Complexity / M
0 Duplication
1 Churn
37 Lines
31 Lines of Code
2 Methods
15.5 LOC / Method

{{getIssueFilterCount()}}

Autofix is being processed.

Found in

{{::issue.Locations[0].Path}}

Found in

{{::location.Path}}:{{::location.StartLine}}-{{::location.EndLine}} ,

{{::lineNumber}}

No issues found

“

Good code is its own best documentation. As you’re about to add a comment, ask yourself, ‘How can I improve the code so that this comment isn’t needed?’

– Steve McConnell