CSC212 Homework 6 2014

From dftwiki3
Revision as of 11:17, 30 October 2014 by Thiebaut (talk | contribs) (Created page with "--~~~~ ---- <br /> <br /> __TOC__ <br /> <br /> <br /> <bluebox>This assignment is due Friday Nov 7, 2014, at 11:55 p.m.</bluebox> <br /> <br /> =Problem #1= <br /> * Add a ne...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

--D. Thiebaut (talk) 12:17, 30 October 2014 (EDT)




Contents




This assignment is due Friday Nov 7, 2014, at 11:55 p.m.



Problem #1


  • Add a new method to your BST program that will output the DOT version of the tree it contains. Refer to Lab 10 for how we generate the DOT version of a tree.
  • Your function must be called generateDot()
  • It must be public so that my test program can access and use it
  • It doesn't have any parameters passed to it.
  • It outputs your name as a label.
  • Here is an example of the type of output it will generate for a given tree:


digraph T {
label = "Mickey Mouse";
8 -> 3;
8 -> 10;
3 -> 1;
3 -> 6;
6 -> 4;
6 -> 7;
10 -> 14;
14 -> 13;
}