Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 979e576

Browse files
refactor 538
1 parent d1daf0c commit 979e576

File tree

1 file changed

+0
-19
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-19
lines changed

‎src/main/java/com/fishercoder/solutions/_538.java‎

Lines changed: 0 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -7,25 +7,6 @@
77
import java.util.List;
88
import java.util.TreeMap;
99

10-
/**
11-
* 538. Convert BST to Greater Tree
12-
*
13-
* Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed
14-
* to the original key plus sum of all keys greater than the original key in BST.
15-
16-
Example:
17-
18-
Input: The root of a Binary Search Tree like this:
19-
5
20-
/ \
21-
2 13
22-
23-
Output: The root of a Greater Tree like this:
24-
18
25-
/ \
26-
20 13
27-
*/
28-
2910
public class _538 {
3011

3112
public static class Solution1 {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /