Linked List Java

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

public class LinkedList {    
    int size;
    Node head;
    Node tail;

    public void insert(int value) {
        if (head == null) {
            head = new Node(null, null, value);
            tail = head;
            return;
        }

        tail.next = new Node(tail, null, value);
        tail = tail.next;
    }

    public void remove(int value){
        Node current_node = head;
        while (current_node != null) {
            if (current_node.item == value) {
                current_node.previous.next = current_node.next;
                current_node.next.previous = current_node.previous;
                return;
            }

            current_node = current_node.next;
        }
    }

    public void print() {
        Node current_node = head;
        while (current_node != null) {
            System.out.println(current_node.item);
            current_node = current_node.next;
        }
    }

    private class Node {
        int item;
        Node next;
        Node previous;

        Node(Node previous, Node next, int value) {
            this.item = value;
            this.next = next;
            this.previous = previous;
        }
    }

    // main method for quick testing
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.insert(10);
        list.insert(13);
        list.insert(17);
        list.insert(16);
        list.insert(14);
        list.remove(17);

        list.print();
    }
}