Binary Search Tree implementation

[Ceasar]

using a binary search tree (BST) as the data structure.
Your implementation:

 will implement the RankBag interface in the RankBagBST class;
 must use the provided Node class for the BST nodes (this class must not be modified
in any way);
 must not depend on the RankBagArray class; and
 will not use any built-in collections to store the objects (with the exception of the
uniqueSet() method).

:confused: Need help.

here to learn as much as i can. so please help if you can.

[Ceasar]

you need to download the .zip to get the files.

[CodesAway]

What do you need help with??

[Ceasar]

jus hints and tips on how to do:

will implement the RankBag interface in the RankBagBST class;
 must use the provided Node class for the BST nodes (this class must not be modified
in any way);
 must not depend on the RankBagArray class; and
 will not use any built-in collections to store the objects (with the exception of the
uniqueSet() method).

[CodesAway]

Right, is there a specific question? Can you post the code that you've written so far?

I'd love to help, but I can't help if I don't know what you need help with. If you're looking for an implementation for binary search tree, check out binary search tree implementation in java.

[Supamagier]

No1's gonna do your homework, 'Ceasar'.