Contents

## Hints

To complete this exercise you need to create the data type `BST`,
with `Eq` and `Show` instances, and implement the functions:

- `bstLeft`
- `bstRight`
- `bstValue`
- `empty`
- `fromList`
- `insert`
- `singleton`
- `toList`

You will find the type signatures already in place, but it is up to you
to define the functions.

Version data entries

14 entries across 14 versions & 1 rubygems

Version	Path
trackler-2.0.0.3	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-2.0.0.2	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-2.0.0.1	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-2.0.0.0	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.4.1	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.4.0	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.3.0	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.2.1	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.2.0	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.1.2	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.1.1	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.1.0	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.0.1	tracks/haskell/exercises/binary-search-tree/HINTS.md
trackler-1.0.0	tracks/haskell/exercises/binary-search-tree/HINTS.md