public class DelegateTree implements IDelegateDB {
    public String name;
    private static int tableSize = 10;
    private int numEntries;
    private static Node root;


    public class Node{
    private Delegate data;
    private Node left;
    private Node right;

    public Node(Delegate data){
     this.data = data;
     right = null;
     left = null;
    }

}
    public DelegateTree(){
        root = null;
        numEntries = 0;
    }

    @Override
    public void clearDB() {
      root = null;
    }

    public boolean Contains(Node node, String name){
        boolean got = false;
        if (node == null){
            System.out.println("Name not found");
            return false;
        }
        else if(name.compareTo(node.data.getName()) == 0){
            System.out.println("Name has been found");
            return true;
        }
        else if(name.compareTo(node.data.getName()) > 0){ //Looks at two nodes and if the correct path is greater than the opposite node, it will run this code since the correct node is greater.
            return Contains(node.right, name);
        }
        else if(name.compareTo(node.data.getName()) < 0){ //Looks at two nodes from the root and if the node in the correct path is greater than the opposite node, it will run this code since the correct node is greater.
            return Contains(node.left, name);
        }
        return false;
        }



    @Override
    public boolean containsName(String name) {

    }


    public Node findPos(Node node, String name){
        if (node == null){
            return null;
        }
        else if(name.compareTo(node.data.getName()) == 0){
            return node;
        }
        else if(name.compareTo(node.data.getName()) > 0){
            node.right = findPos(node.right, name);
        }
        else if(name.compareTo(node.data.getName()) < 0){
            node.left = findPos(node.left, name);
        }
        return null;
        }


    @Override
    public Delegate get(String name) {
        System.out.println("Getting name..");
        Node find = findPos(root, name);
        if (find == null){
            System.out.println("Name not found" + name);
            return null;
        }
        System.out.println("Name is found:" + name);
        Delegate temp = find.data;
        return temp;
        }

    @Override
    public int size() {
        return numEntries;
    }

    @Override
    public boolean isEmpty() {
        return size() == 0;
    }

    @Override
    public Delegate put(Delegate delegate) {
        assert delegate == null;
        Node temp = insert(root, delegate);
        if (numEntries == 0){
            root = temp;
        }
        return delegate;

    }

    public Node insert(Node node, Delegate data){
        String name = data.getName();
        if (node == null){
            node = new Node(data);
            System.out.println(name);
        }
        else if(name.compareTo(node.data.getName()) > 0){ //Looks at two nodes and if the correct path is greater than the opposite node, it will run this code since the correct node is greater.
            node.right = insert(node.right, data);
        }
        else if(name.compareTo(node.data.getName()) < 0){//Looks at two nodes from the root and if the node in the correct path is greater than the opposite node, it will run this code since the correct node is greater.
            node.left = insert(node.left, data);
        }
        return node;
        }


    @Override
    public Delegate remove(String name) {
    }


    @Override
    public void displayDB() {

    }