Assignment Instructions:
·
Starting
with basicTree.java as your code base, rename the file to Traversal.java
·
Write
a method(s) to copy a tree, using the appropriate traversal.
·
Write
a method(s) to delete a tree, using the appropriate traversal.
·
Create
test output using the appropriate traversal.
Sample
output for one run:
Grading:
·
Submit
Traversal.java and TraversalDriver.java to the moodle A2
·
40
points for documentation
·
40
points for fully functioning code
·
20
points for matching formatting of output.
·
Total
= 100 points
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |