Help me quick

Complete the get and put methods for the following Binary Search Tree. You can assume that Key implements Comparable; and Value class is given. State any assumptions you make in your implementation. public class BST, Value> State any assumption ou make in jour implementation. t private Node root //Root of Binary Search Tree private class Nodef //Key //Associated Value private Key key: private Value val; private Node left, right: //Links to sub trees private int N //.of nodes in subtree rooted // here public Node (Key key, Value val, int N) t this.key keyi this.val = val; this,N N