题目描述：
LeetCode 538. Convert BST to Greater Tree
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater ...
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]Convert BST to Greater Tree
[LeetCode]Diameter of Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 543. Diameter of Binary Tree
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 longest path between any two nodes ...
LeetCode Weekly Contest 23解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 23是LeetCode举办的第二十八场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-23/
题解列表：
LeetCode 541. Reverse String II
LeetCode 539. Minimum Time Difference
[LeetCode]Word Abbreviation
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 527. Word Abbreviation
Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below.
- Begin with the first character and then the number of characters abbreviated, which followed ...
[LeetCode]Construct Binary Tree from String
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 536. Construct Binary Tree from String
You need to construct a binary tree from a string consisting of parenthesis and integers.
The whole input represents a binary tree. It contains an integer followed by zero, one or two ...