From : https://leetcode.com/problems/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.
/**
* 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) {
int mdp;
maxDepthCore(root, mdp, 0);
return mdp;
}
void maxDepthCore(TreeNode* node, int& dep, int cur) {
if(!node && dep<cur) {
dep = cur;
return;
}
if(node) {
maxDepthCore(node->left, dep, cur+1);
maxDepthCore(node->right, dep, cur+1);
}
}
};
/**
* 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) return 0;
return 1+max(maxDepth(root->left), maxDepth(root->right));
}
};