project 3- putting it all together

Subject:

Comments:
: I'm wondering if all of the people who thought the class was hard and that it suxed have dropped out? Am I now going to be the only loser in the class? Where is everyone? Are you all hard at work for this project? I don't get what we're supposed to do - I mean : It looks like this to me: : Build a map class that wraps around a preffered tree. : What is wrapping mean? : I've been looking at the examples that Dr. VW gave and am still confused... First of all, I think it's too late to reconstruct a red-black or tri or splay or etc. tree.... so if I use my AVL : tree then basically call the tree and use its constructors and functions from within map... right? : Agh, so OK_ here is where I get confused.. then if I call my AVL functions to construct map functions--- I am way beyond confused??? then how do I handle linking the two memebers of Map (data, key) to the AVlNode of the tree??? : Am I on the right track???? : The second part is:: : We're creating an Iterator for only Map, right? Not for the tree?? : so is the definition of Iterator::::? : Iterator pointer points to Map object which acts like a Tree object, but since there are two related Map objects per Iterator then data of Map has the data while the key of Map has the next linker that is pointed by the Iterator??? : Oh gosh, hope didn't confuse yall.. : I need major help!!!! Can someone help?

Optional Link URL:
Link Title:
Optional Image URL: