翻譯
給定一個二叉樹,找出它的最大深度。
最大深度是指的從根節點一直到最遠的葉節點中所有的節點數目。
原文
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.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int dfs(TreeNode* root) {
if (root == NULL)
return 0;
return 1 + max(dfs(root->left), dfs(root->right));
}
int maxDepth(TreeNode* root) {
return dfs(root);
}
};