Difference between revisions of "Binary Int Tree Assignment"
Jump to navigation
Jump to search
Line 6: | Line 6: | ||
=Examples= | =Examples= | ||
+ | ==EMPTY== | ||
+ | EMPTY | ||
+ | ==1== | ||
+ | [[File:Binary int tree 1.svg]] | ||
+ | ==3== | ||
+ | NODE(NODE(EMPTY, 1, EMPTY), 2, NODE(EMPTY, 3, EMPTY))) | ||
+ | |||
+ | [[File:Binary int tree 3.svg]] | ||
+ | ==7== | ||
+ | NODE(NODE(NODE(EMPTY, 1, EMPTY), 2, NODE(EMPTY, 3, EMPTY)), 4, NODE(NODE(EMPTY, 5, EMPTY), 6, NODE(EMPTY, 7, EMPTY)))) | ||
+ | |||
[[File:Binary int tree 7.svg]] | [[File:Binary int tree 7.svg]] | ||
Revision as of 04:04, 21 October 2022
Contents
Motivation
Prepare for the Binary Search Tree Exercise with a simpler warm up.
int_tree
datatype int_tree = NODE of (int_tree * int * int_tree) | EMPTY
Examples
EMPTY
EMPTY
1
3
NODE(NODE(EMPTY, 1, EMPTY), 2, NODE(EMPTY, 3, EMPTY)))
7
NODE(NODE(NODE(EMPTY, 1, EMPTY), 2, NODE(EMPTY, 3, EMPTY)), 4, NODE(NODE(EMPTY, 5, EMPTY), 6, NODE(EMPTY, 7, EMPTY))))
Code to Implement
file: | src/main/sml/binary_int_tree/warmup_binary_int_tree.sml | ![]() |
functions: | sum |
sum
fun sum(node : int_tree) : int = raise Fail("NotYetImplemented")
sum_accumulate
fun sum_accumulate(init : int, node : int_tree) : int = raise Fail("NotYetImplemented")
fold_rnl
(* * depth-first, reverse in-order traversal * https://en.wikipedia.org/wiki/Tree_traversal#Reverse_in-order_(RNL) *) fun fold_rnl(f : (int * 'a) -> 'a, init : 'a, node : int_tree) : 'a = raise Fail("NotYetImplemented")
Testing
source folder: | src/test/sml/warmup_binary_int_tree |
how to run with CM.make verbosity off: | sml -Ccm.verbose=false run_binary_int_tree_testing.sml |
how to run with CM.make verbosity on: | sml run_binary_int_tree_testing.sml |
note: ensure that you have removed all printing to receive credit for any assignment.