LeetCode-Python: Maxinum Depht of Binary Tree
Problem: 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.
Solution: Maxinum Depht of Binary Tree, Python:
|
|
深搜,递归求解。