Specify and implement a class of binary search trees in which duplicate entries are allowed. Place the duplicate of an entry in the entry's right subtree, as suggested in Segment 25.4. Provide a method that searches the tree for a given entry and returns the first one it finds. Also, provide a similar method that returns a list of all entries that match the given one.