【leetcode刷题笔记】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.

---

 

题解：递归，树的高度 = max(左子树高度,右子树高度)+1；

代码如下：

 1 /**

 2  * Definition for binary tree

 3  * public class TreeNode {

 4  *     int val;

 5  *     TreeNode left;

 6  *     TreeNode right;

 7  *     TreeNode(int x) { val = x; }

 8  * }

 9  */

10 public class Solution {

11     public int maxDepth(TreeNode root) {

12         if(root == null)

13             return 0;

14         

15         int left = maxDepth(root.left);

16         int right = maxDepth(root.right);

17         

18         return Math.max(left, right)+1;

19     }

20 }

被虐了一天，瞬间好受多了:-)