【leetcode】104. Maximum Depth of Binary Tree
文章目录
1. 题目
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.
2. 思路
递归到左、右子树的max值,+1.
3. 代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
if (root == NULL) { return 0; }
return 1 + max(maxDepth(root->left), maxDepth(root->right));
}
};

评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论