Java8 programming,generics,binary search tree, please use the template in the graph to solve this problem, please explain in detail

Once you finished the previous questions, attempt to implement a Binary Search Tree. A binary search tree can be implemented as a linked data structure where the a node will contain two links, a left ad right child. You may use the following scaffold for BinaryTree. public class BinarySearchTree implements Iterable> { private Node root; public BinaryTree () { root = null; When adding an element to the tree, your element should be added to the root if it is null (or the same key), if the root is not null, it should check to see if the it is less than the root (keys must use compareTo () method) and attempt to add to the left child, else add to the right child. long size (), returns the number of elements added to the tree. void put (K key, v value), puts a value in the V get (K key), Using the key, it will return the value mapped to the key. V remove (K key), removes the Node in the tree and returns the value