LeetCode:Maximum Depth of Binary Tree

Maximum Depth of Binary Tree

Total Accepted: 145230 Total
Submissions: 302450 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

Hide Tags
 Tree Depth-first
Search

Hide Similar Problems
 (E) Balanced Binary Tree (E)
Minimum Depth of Binary Tree

c++ code:

/**
* 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;
else return max(maxDepth(root->left),maxDepth(root->right)) + 1;
}

// 自定义函数
int max(int x,int y) { return x>y?x:y; }
};