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.

public class Solution {
public int maxDepth(TreeNode root) {
if(root == null)
return 0;
else{
int left = maxDepth(root.left)+1;
int right = maxDepth(root.right)+1;
return Math.max(left, right);
}
}
}

递归思想。