Posted by Lil' Viv on July 31, 2001 at 06:51:54:
In Reply to: my tree posted by please help.. on July 30, 2001 at 13:54:20:
LOL, sorry . . . because I was done with the project . . . I got out of CS mode and caught up on other stuff, hence not checking the message board and stuff . . . probably a little too late, but might help on other projects ... I'll give it a shot.
For this project, all I did was use my AVL tree, just plug it in and make it work with his map interface, ignoring the millions of files he has on his site . . . and, I never even had to look at anything else. There was just a little confusion on what to include where, but other than that . . . everything worked. I already had an iterator that was used on Project 2, so I was pretty much done with this project before it started. I'm glad I got to reuse my AVL tree, 'cause I busted my ass for that . . . like spent over 60 hrs. on it.
The red-black tree he provided was effectively a slow linked list, so there's no way you could icount that and run it . . . would take far more than like 10 minutes, I bet on his machine. =P So, I think all that needed to be done was to write balancing routines for the red-black tree . . . but, I had no intention of recreating the hell I went through to write my AVL tree . . . so, I passed on the red-black deal.
My only hurdle I had to jump today was to eliminate my use of the STL, so to write a stack. So, no biggie. I ended up wasting a lot of time in his office hours just to see if I successfully passed the robust test with no time limit, but got to play with his Robotics stuff during the 2 hr. wait. I drew a little drawing a made fun of him a bit for it, so it was all good.
Basically, I think finishing Project 1 set this class in motion for me . . . I'm not sure if I answered your question at all, I didn't understand what you were asking. If I didn't answer your question, repost it. =P
Good luck! =)