【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；

代码如下：

 /**
  * Definition for binary tree
  * 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;

         int left = maxDepth(root.left);
         int right = maxDepth(root.right);

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

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