The goal of this question is to implement binary tree nodes which will then be used for implementing a generic binary tree which, in turn, will be used to implement heaps and binary search trees. As you know, heaps and binary search trees are defined for objects with associated keys that are comparable to each other. For these keys, we will use comparable objects. For testing purposes, keys will be instances of the class MyInteger and you will need the Hashable interface. If you are using Eclipes, create a project for this assignment and add Comparable and MyInteger before you continue.
I need somebody to do this for me, It should not require a lot of time.
please message me if you are interested in doing this for me, and how much you want for it. I will give you more details then.