I am developing a class called AVLtree, this class contains the methods get(), put(), remove(), and ascend(). This class allows multiple keys to be the same.
My questions are: How would you be able to get() if there are multiple same keys? How would you get something that is passed a node of the same key? Also, when inserting a new node that has the same key, when the traversal to insert gets to a node with that same key, does it go to the left subtree or right subtree?
Any help would be greatly appreciated, if I need to clarify anything just let me know. This is very important to my learning of Java and BST's and so far the sites I've found in Google haven't explained any of these questions.
Thank you,
CSH