Assignment help!!

Convert Java Binary Search Tree implementation into Racket, using lists to define data structure.

class Tree 10 Torta meloods modet bets C SD float value; (CCConfleb) toup) Tonttobe-boods Tree (Tree left, float value, Tree right) { b Sotesd-onlieb noon this.left = left; Do o rdsoflioggle nabosolito this.value = value; ( C a tteb) toup) Toresdonitob) DUIT doods this.right = right; Suombre de motleb to Tree setLeft (Tree left) { return new Tree(left, this.value, this.right); } Tree setValue(float value) { return new Tree(this.left, value, this.right); } Tree setRight (Tree right) { return new Tree(this.left, this.value, right); } static Tree insert(Tree node, float value) { if (node == null) { return new Tree (null, value. null); if (value == node.value) { di mo return node.setValue(value); if (value