LeetCode:104. Maximum Depth of Binary Tree

LeetCode: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],

    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.

意思就是计算一个二叉树的最大深度。

思路一：层次遍历

Python 代码实现

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

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        queue = []
        if (root == None):
            return 0
        queue.append(root)
        depth = 0
        
        while(len(queue) > 0):
            depth+=1
            # 这里先计算此层的节点个数，然后将这一层的左右子结点入队。
            l = len(queue)
            for i in range(l):
                t = queue.pop(0)
                if (t.left != None):
                    queue.append(t.left)
                if (t.right != None):
                    queue.append(t.right)
                
        return depth

首先，用一个队列来暂存树中的节点。每次从队首取出一个节点并将它的左右子结点插入到队尾，直到遇到这一层的最右边的那个节点，深度加1。

思路二：递归实现深度优先遍历

Python 代码实现

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if (root == None):
            return 0
        else:
            left_height = self.maxDepth(root.left)
            right_height = self.maxDepth(root.right)
            return max(left_height, right_height) + 1

分别递归计算左右子树的最大深度，取较大值。

---

THE END.