|
|
Post by 1.8T on Mar 6, 2002 20:31:32 GMT -5
wow, seems like no one is posting questions about this assignment?.,,. arghhh i can't believe this is due the same day we have our mat137 test  can we petition or something??., having to worry about two things is rough  |
|
|
|
Post by Observer on Mar 7, 2002 15:27:38 GMT -5
Relax, the due date is 18th (that's next Monday). I'm not starting this until the test is out of the way.
|
|
|
|
Post by Sylph on Mar 7, 2002 20:58:25 GMT -5
for anyone who's started, is this assignment long? or is the due date farther away becuz ppl have tests?
|
|
|
|
Post by CooLiBoP on Mar 10, 2002 18:03:04 GMT -5
Its not necessarily long...its just very confusing with the recursion and all...Very tricky not long ;D
|
|
bAh
Junior Member
Posts: 23
|
Post by bAh on Mar 10, 2002 23:17:58 GMT -5
urgh.... can somebody plz give us hints on how to get started on this big shiety assignment?? I tried to ask my TA for advices and he said that he hasn't looked at the assignment handout yet...  .... oh... how helpful  |
|
|
|
Post by Evotamer on Mar 11, 2002 0:44:19 GMT -5
Umm...
Think logically... with recursion think of what needs to be done, and find a pattern that is used with each iteration. Also make sure you know when to end the recursion and make sure it does so.
|
|
|
|
Post by EurasianVixen on Mar 11, 2002 22:30:50 GMT -5
I'm so stumped on this one. I've done the skeleton for URLTree (that is, putting the necessary methods stated in the handout) but I don't know where to go from there. I guess my biggest problem is that I don't know how these two classes interact with each other .... And I pretty much understand how a binary tree works since it only has a left and right branch, but the tree that we have to construct in A4 has many branches. Urgh, I'm at such a stand-still ...  Does anyone fully understand how this assignment is suppose to work? And when they say "store the node's references in some sort of list", what does this mean? |
|
|
|
Post by Evotamer on Mar 11, 2002 23:21:37 GMT -5
A binary tree has some properties like this:
int key
node left
node right
The tree that you have has many branches comming out of it... so perhaps you shouldn't just use two nodes but many nodes. I'd advise you to have in each node maybe a linked list or array of nodes. Ummm hmm... that's how I'd tackle this...
I don't think the solution is complex... so don't make it more complex than it really is.. just think up a good structure to your tree.. and then implement it with code
|
|
|
|
Post by Random_Death on Mar 15, 2002 23:57:19 GMT -5
It's not that bad of an assignment. As for storing the nodes in "some sort of list" they tell you which three kinds of lists you can use on the handout.
One nice method to start with is the size method.
|
|
.... oh... how helpful 
