We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 0bf9860 + 0ff8d47 commit 4980e96Copy full SHA for 4980e96
README.md
@@ -38,7 +38,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
38
39
- [Trees](src/_DataStructures_/Trees)
40
- [Binary Search Tree](src/_DataStructures_/Trees/BST)
41
- - [Find k<sup>th<sup> maximin in a BST](src/_DataStructures_/Trees/BST/find-kth-max)
+ - [Find k<sup>th</sup> maximum in a BST](src/_DataStructures_/Trees/BST/find-kth-max)
42
- [Suffix Tree](src/_DataStructures_/SuffixTree)
43
44
### Logical Problems
0 commit comments