LeetCode.104.Maximum Depth of Binary Tree 二叉树的最大深度/二叉树的高度

题目描述

104 Maximum Depth of Binary Tree https://leetcode-cn.com/problems/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.

解题过程

二叉树的最大深度，即二叉树的高度，很适合递归求解

public int maxDepth(TreeNode root) {
    if (null == root) {
        return 0;
    }
    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}

GitHub代码

algorithms/leetcode/leetcode/_104_MaximumDepthOfBinaryTree.java https://github.com/masikkk/algorithms/blob/master/leetcode/leetcode/_104_MaximumDepthOfBinaryTree.java