Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath between any two nodes in a tree. This path may or may not pass through the root.
Example:
Given a binary tree
1 / \ 2 3 / \ 4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].
Note: The length of path between two nodes is represented by the number of edges between them.
这道题求二叉树的直径,并说明直径就是两点之间的最远距离,只要对每一个结点求出其左右子树深度之和,再加上1就可以更新结果res了。为了减少重复计算,可以用哈希表建立每个结点和其深度之间的映射,这样某个结点的深度之前计算过了,就不用再次计算了,参见代码如下:
class Solution {
public:
int diameterOfBinaryTree(TreeNode* root) {
if (!root) return 0;
int res = getHeight(root->left) + getHeight(root->right);
return max(res, max(diameterOfBinaryTree(root->left), diameterOfBinaryTree(root->right)));
}
int getHeight(TreeNode* node) {
if (!node) return 0;
if (m.count(node)) return m[node];
int h = 1 + max(getHeight(node->left), getHeight(node->right));
return m[node] = h;
}
private:
unordered_map<TreeNode*, int> m;
};