leetcode-104-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.

分析


求根节点到叶结点的最大距离,和求树的最小深度是类似的。 leetcode-111-Minimum-Depth-of-Binary-Tree

解决方案1(C++)


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
* 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;
}
if(root->left == NULL) {
return maxDepth(root->right) + 1;
}
if(root->right == NULL) {
return maxDepth(root->left) + 1;
}
int left_depth = maxDepth(root->left);
int right_depth = maxDepth(root->right);
return max(left_depth, right_depth)+1;
}
};

相关问题


(E) Minimum Depth of Binary Tree
(E) Balanced Binary Tree

题目来源