104. Maximum Depth of Binary Tree
- Total Accepted: 160295
- Total Submissions: 328352
- Difficulty: Easy
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.
Subscribe to see which companies asked this question
思考:二叉树的深度,基础题
public class Solution {
public int maxDepth(TreeNode root) {
if(root == null){
return 0;
}
if(root.left == null && root.right == null){
return 1;
}
int left = maxDepth(root.left);
int right = maxDepth(root.right);
return (left > right ? left : right) + 1;
}
}