标签：des style blog color io ar for sp div
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.
Solution: Recursion.
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 return Math.max(maxDepth(root.left), maxDepth(root.right))+1; 15 } 16 }
[Leetcode] Maximum Depth of Binary Tree
标签：des style blog color io ar for sp div
原文地址：http://www.cnblogs.com/Phoebe815/p/4027900.html
