标签：nod max rom color 遍历 public ret pat imu
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.
求树的高度。
深度优先搜索遍历。递归实现。
/** * 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; if( root.left == null && root.right == null) return 1; if( root.left == null) return maxDepth(root.right)+1; if( root.right == null) return maxDepth(root.left)+1; return Math.max(maxDepth(root.left),maxDepth(root.right))+1; } }
leetcode 104 Maximum Depth of Binary Tree ----- java
标签：nod max rom color 遍历 public ret pat imu
原文地址：http://www.cnblogs.com/xiaoba1203/p/5999785.html
