【LeetCode】(104)Maximum Depth of Binary Tree(Easy)

题目

Maximum Depth of Binary Tree

Total Accepted: 79538 Total
Submissions: 176206My Submissions

Question
Solution

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 maxDepth(TreeNode* root) {
if (root==nullptr)
{
return 0;
}
return max(maxDepth(root->right),maxDepth(root->left))+1;
}
};