Skip to content

Fix articles/kth-smallest-integer-in-bst.md#5334

Open
DSeung001 wants to merge 1 commit intoneetcode-gh:mainfrom
DSeung001:fix/0230-kth-smallest-integer-in-bst
Open

Fix articles/kth-smallest-integer-in-bst.md#5334
DSeung001 wants to merge 1 commit intoneetcode-gh:mainfrom
DSeung001:fix/0230-kth-smallest-integer-in-bst

Conversation

@DSeung001
Copy link

@DSeung001 DSeung001 commented Jan 23, 2026

  • File(s) Modified: articles/kth-smallest-integer-in-bst.md
  • Language(s) Used: Go
  • Submission URL: N/A (Documentation fix, not a code solution)

Fixes #5330

Description

Fixed the Go brute force solution that was using inorder traversal $(O(n))$.
Now collects all values and sorts them to achieve $O(n log n)$ time complexity, consistent with other language implementations.

Important

Please make sure the file name is lowercase and a duplicate file does not already exist before merging.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Bug Report for kth-smallest-integer-in-bst

1 participant