I need help implementing the get method on a Binary Search Tree(BST) in JAVA . Implement the TODO.
CODE:
private class BstEntry implements Entry {
private final K key;
private final V value;
private BstEntry left;
private BstEntry right;
private BstEntry parent;
public BstEntry(K key, V value) {
this.key = key;
this.value = value;
this.left = null;
this.right = null;
this.parent = null;
}
@Override
public K getKey() { return key; }
@Override
public V getValue() { return value; }
public BstEntry getLeft() { return left; }
public BstEntry getRight() { return right; }
public BstEntry getParent() { return parent; }
public void setLeft(BstEntry entry) { left = entry; }
public void setRight(BstEntry entry) { right = entry; }
public void setParent(BstEntry entry) {
PayPal Gateway not configured
PayPal Gateway not configured