exercism / exercism/problem-specifications
Update binary search tree documentation
Open
- Dominant language
- Ruby
- Stars
- 358
- Forks
- 563
- Avg merge
- 18h 41m
- Merged PRs (30d)
- 2
Description
In the tests for the `binary-search-tree` exercise, I think this assertion may be wrong as inserting a duplicate value into a BST has no effect (as checked by `bstValue t `shouldBe` Just 4`) and therefore I believe that `bstLeft` should be `Nothing`.
https://github.com/exercism/haskell/blob/23a8841dc163c0f82b9b999a16d5cf41e77c0fe3/exercises/practice/binary-search-tree/test/Tests.hs#L35
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.