BSTMap

Implement the map using a regular Binary Search Tree (do not perform any balancing). Make sure that the tree nodes, like the LinkedMap nodes, have both key and value fields in them (on top of the references to left and right nodes). Each node should also store the pre-computed size of tYour task for this project is to implement and analyze the performance of three implementations of a Map interface. It is similar to the Project 1 you will implement these data structures, write performance tests for them, and submit a detailed report.

use java