Difference between revisions of "Dynamic Binary Int Tree Assignment"
Jump to navigation
Jump to search
Line 9: | Line 9: | ||
==contains== | ==contains== | ||
==sum== | ==sum== | ||
− | = | + | =Test= |
+ | {{RacketUnitTest|binary_int_tree_test|binary_int_tree}} |
Latest revision as of 07:06, 9 November 2022
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 |
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.