104. 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.

Note: A leaf is a node with no children.

Example:
Given binary tree [3,9,20,null,null,15,7],

1.DFS(深度优先搜索)：
class Solution(object):
def maxDepth(self, root):
if not root:
return 0
return 1+max(self.maxDepth(root.left),self.maxDepth(root.right))
2.BFS(广度优先搜索)：—利用队列

class Solution(object):
    def maxDepth(self, root):
        if not root:
            return 0
        depth=0
        queue = collections.deque()
        queue.append(root)
        while queue:
            depth += 1
            for _ in range(len(queue)):
                node = queue.popleft()
                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)
        return depth