public SortedSetADT<E> tailset(E element) {

        SortedSetADT<E> subSet = new BstSetKTU<>();

        BstNode<E> node = root;

        while (node != element) {

            if (element.compareTo(node.element) > 0) {
                node = node.right;
            } else if (element.compareTo(node.element) < 0) {
                node = node.left;
            } else if (element.compareTo(node.element) == 0) {

                while (node.right != null)
                {
                    subSet.add(node.element);
                    node = node.right;
                }

                if (node.right == null) subSet.add(node.element);
            }

            return subSet;
        }
        return subSet;
    }