RemoveAfter - Linked List

package stack;

public class LinkedListStack<Item> {

    private Node first;
    private int N;

    private class Node {

        Item item;
        Node next;
    }

    public boolean isEmpty() {
        return first == null;
    }

    public int size() {
        return N;
    }

    public void delete(int k) {
        if (first == null) {
            return;
        }
        Node n = first;
        for (int i = 0; i < k - 1; i++) {
            if (n.next == null) {
                return;
            }
            n = n.next;
        }
        if (n.next == null) {
            return;
        }
        n.next = n.next.next;
        --N;
    }
    
    public boolean find(Item item) {

        Node n;
        for (n = first; n != null; n = n.next) {
            if (n.item == item) {
                return true;
            }
        }
        return false;
    }

    public void push(Item item) {
        Node oldfirst = first;
        first = new Node();
        first.item = item;
        first.next = oldfirst;
        N++;
    }

    public void peek() {
        System.out.println("Last node contains: " + first.item);
    }

    public Item pop() {
        Item item = first.item;
        first = first.next;
        N--;
        return item;
    }
}

package stack;

public class LinkedListStackTest {

    public static void main(String[] args) {
          
       boolean found = true;
       LinkedListStack<String> lls = new LinkedListStack();  
       
       lls.push("a");
       lls.push("b");
       lls.push("c");
       lls.push("d");
       
       lls.delete(2);
       
       found = lls.find("b");
       if(found)
        System.out.println("The element was found");
       else 
        System.out.println("The element wasn't found");
    }
}