Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Tree Depth-first Search| Runtime Error Message: | {[{ runtimeError }]} |
| Last executed input: | {[{ lastExecutedTestCase }]} |
| Input: | {[{ resultWaTestCaseInput }]} |
| Output: | {[{ resultWaTestCaseOutput }]} |
| Expected: | {[{ resultWaTestCaseExpected }]} |