问题描述:
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.
原问题链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
问题分析
这个问题的思路比较容易得到。要求树的最大深度,对任意的一个节点来说,主要递归的求它两个子树的最大深度再加1。而如果当前节点为空,则返回0。
详细的代码实现如下:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int maxDepth(TreeNode root) { if(root == null) return 0; return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1; } }