Posted by neha on July 30, 2001 at 17:08:02:
In Reply to: my tree posted by please help.. on July 30, 2001 at 13:54:20:
: For the previous assignments, I used with little manipulation the trees that were given in the book.. For those of you that are capable beyond that, I was wondering if you could help me understand how you guys go about reinventing the wheel on creating new trees. If I have 2 ways of implementing (array or node implementation), then what details are good to look at?.. For example, the red black tree that was given br Dr. VW works fine for Project 3 but it looks as though because it's unbalanced, the robust test fails because it takes too long to go through the tree. Besides balancing a tree, could anyone help me out with how I should look at changing the given (balanced) trees around to make it better or at least my own.. I thank you in advance.
i'm not sure how to re-invent the AVL tree coz mine never worked, but i think that for this assignment, pretty much everyone's program is exceeding the time limit...i'm using a red-black tree and i'm getting the same problem...i think it's becoz he set it too low, and not becoz the red-black tree is unbalanced or whatever....so i'm assuming that if the code runs fine on the small test, it should work with the other one too when he increases the limit after the deadline (if he does that :))
neha