leetcode104题 题解 翻译 C语言版 Python版

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.

104.二叉树的最大深度

给定一个二叉树，求其最大深度。

最大深度是指从根结点向下沿着最长路径到最远的叶结点的结点数量。

思路：递归可快速解决问题。调用函数自身来得到左子树的最大深度和右子树的最大深度，将两个深度比较，取大者加1后返回。递归的终点是判断root是否为NULL，表示已到叶结点的左右子树上，此时返回深度为0。整个过程是递归式的深度优先遍历。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {
    if (root == NULL) return 0;
    int leftDepth = maxDepth(root->left);
    int rightDepth = maxDepth(root->right);
    if (leftDepth > rightDepth) return leftDepth + 1;
    else return rightDepth + 1;
}

# 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 root == None: return 0
        leftDepth = self.maxDepth(root.left)
        rightDepth = self.maxDepth(root.right)
        return leftDepth + 1 if leftDepth > rightDepth else rightDepth + 1