Dynamic Binary Int Tree Assignment

Provided

(struct branch (left x right) #:transparent)

(define empty-tree #f)

Code to Implement

file:	src/main/racket/binary_int_tree/binary_int_tree.rkt
functions:	insert contains sum

Test

file:	binary_int_tree_test.rkt	Test
source folder:	src/test/racket/binary_int_tree

note: ensure that you have removed all printing to receive credit for any assignment.