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 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;
return getDepth(root,1);
}
public int getDepth(TreeNode node, int depth){
int left = depth, right = depth;
if (node.left != null) left = getDepth(node.left, depth+1);
if (node.right != null) right = getDepth(node.right, depth + 1);
return left > right ? left:right;
}
}
利用递归遍历整个binary tree. 深度优先, 从左到右. 用depth作为函数在递归中传递. 每次递归返回下一级节点以及深度.