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

main

competitiveprogramming

A

Binary Tree\Maximum Depth of N-ary Tree\main.cpp

7 Complexity
1.4 Complexity / M
0 Duplication
1 Churn
55 Lines
48 Lines of Code
5 Methods
9.6 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

“

Any fool can write code that a computer can understand. Good programmers write code that humans can understand.

– Martin Fowler