问题描述
https://oj.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.
问题分析:
二叉树类的问题都会考虑采用递归的方式进行求解,因为二叉树本身就是递归定义的。采用递归方案后解法就很直观了:
1. 空树最大深度是0. 2. max (左子树的最大深度, 右子树最大深度) + 1
示例代码:
/**
* Definition for binary tree
* 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;
int lh = maxDepth(root->left);
int rh = maxDepth(root->right);
return lh > rh ? lh + 1 : rh + 1;
}
};
问题描述:
https://oj.leetcode.com/problems/minimum-depth-of-binary-tree/点击打开链接
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
最小深度: 从根节点开始到叶子节点结束的最短路径上的节点数。采用递归方案的解法:
1. 空树最小深度是0.
2. 左子树空: 右子树最小深度+ 1
3. 右子树空: 左子树最小深度 + 1
4. min(左子树最小深度,右子树最小深度) + 1
示例代码:
int minDepth(TreeNode *root)
{
if (!root) return 0;
int hl = minDepth(root->left);
int hr = minDepth(root->right);
if (!hl) return hr + 1;
if (!hr) return hl + 1;
return hl < hr ? hl + 1 : hr + 1;
}
最小深度和最大深度在计算的细节上有不同,需要注意体会。