New Problem: kth max & min in BST #62
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
TheSTL
reviewed
Oct 10, 2019
|
|
||
| function findKthMax(rootNode, k) { | ||
| const arr = inOrderTraversal(rootNode); | ||
| return arr[arr.length - k]; |
There was a problem hiding this comment.
Check if k > arr.length then throw error.
ashokdey
changed the title
TheSTL
reviewed
Oct 10, 2019
|
|
||
| function findKthMax(rootNode, k) { | ||
| const arr = inOrderTraversal(rootNode); | ||
| if (k < 0 || k > arr.lenth) { |
There was a problem hiding this comment.
if k = 0
then return is undefined becuase arr[arr.length - 0 ]
TheSTL
reviewed
Oct 10, 2019
|
|
||
| function findKthMin(rootNode, k) { | ||
| const arr = inOrderTraversal(rootNode); | ||
| if (k < 0 || k > arr.lenth) { |
There was a problem hiding this comment.
if k = 0
then return is undefined becuase arr[ 0 - 1 ]
TheSTL
approved these changes
Oct 10, 2019
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🍂 What's Inside?
The solution is simple, return the inorder traversal of a BST which returns a sorted array (ascending order)