public E removeMin()
    {
        if (root == null) {
            return null;
        }

        if (root.left == null) {
            E temp = root.data;
            root = root.right;
            return temp;
        }

        Node<E> parent = null;
        Node<E> node = root;

        while (node.left != null) {
            parent = node;
            node = node.left;
        }
        E temp = node.data;
        parent.left = node.right;

        return temp;

    }