Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Using sml to code Here is a small exercise to get you working with trees. Make a  le, P2.sml, and place in it this de nition of IntTree: IntTree = Leaf | Node of int * IntTree * IntTree Now, code this function, using any of the functions you have encountered so far on lists and trees: (* sumInts : IntTree -> int adds up all the ints contained in InTree t and returns the total. Examples: sumInts (Node(3, Node(2, Leaf, Node(4, Leaf, Leaf)), Leaf)) = 9 sumInts (Leaf) = 0 *) Test your function on the two test cases listed above. Copy and paste your output

Using sml to code Here is a small exercise to get you working with trees. Make a  le, P2.sml, and place in it this de nition of IntTree: IntTree = Leaf | Node of int * IntTree * IntTree Now, code this function, using any of the functions you have encountered so far on lists and trees: (* sumInts : IntTree -> int adds up all the ints contained in InTree t and returns the total. Examples: sumInts (Node(3, Node(2, Leaf, Node(4, Leaf, Leaf)), Leaf)) = 9 sumInts (Leaf) = 0 *) Test your function on the two test cases listed above. Copy and paste your output

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Using sml to code
Here is a small exercise to get you working with trees. Make a  le, P2.sml, and place in it this de nition of
IntTree: IntTree = Leaf | Node of int * IntTree * IntTree
Now, code this function, using any of the functions you have encountered so far on lists and trees:
(* sumInts : IntTree -> int
adds up all the ints contained in InTree t and returns the total.
Examples: sumInts (Node(3, Node(2, Leaf, Node(4, Leaf, Leaf)), Leaf)) = 9
sumInts (Leaf) = 0 *)
Test your function on the two test cases listed above. Copy and paste your output

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS