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
This repository was archived by the owner on Dec 19, 2023. It is now read-only.

Commit c18ee21

Browse files
committed
Fix description of problem 1038
1 parent e2b2081 commit c18ee21

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎algorithms/1038/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,4 +23,4 @@ As a reminder, a *binary* search tree is a tree that satisfies these constraints
2323
2. Each node will have value between 0 and 100.
2424
3. The given tree is a binary search tree.
2525

26-
**Note: This question is the same as 538: https://leetcode.com/problems/convert-bst-to-greater-tree/
26+
**Note:** This question is the same as 538: https://leetcode.com/problems/convert-bst-to-greater-tree/

0 commit comments

Comments
(0)

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