卖萌的弱渣

I am stupid, I am hungry.

Maximum Depth of Binary Tree

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

  • DFS
(Maximum-Depth-of-Binary-Tree.py) download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        return self.dfs(root,0)

    def dfs(self,root,cur):
        if root == None:
            return cur
        depth = max(self.dfs(root.left,cur+1), self.dfs(root.right,cur+1))
        return depth