(to be done in Dr.Racket)

The following file contains an implementation of some functions for a binary search tree.

binary-search-tree.rkt (refer to screen shots)

Implement a function (search value binary-search-tree) to search a binary search tree for a given value. It should return #t (true) if the value is in the tree and #f (false) if not.

Extra credit : Implement a function (delete value binary-search-tree) that removes the given value from the binary search tree. It should return the modified binary search tree.

screen shots: