package TemaSeminarTAP;

class lista<T extends Comparable<T>> {
    int nr;

    class Nod {
        T infor;
        Nod next;
        Nod prev;

        Nod() {
            nr++;
        }

        Nod(T x) {
            infor = x;
            nr++;
        }

    }

    Nod head;

    lista() {
        head = null;
    }

    lista(T x) {
        head = new Nod(x);
        nr++;
    }

    public void add(T x) {
        if (head == null)
            head = new Nod(x);
        else {
            Nod parcurgere = head;
            for (int i = 0; i < nr; i++) {
                if (x.compareTo(parcurgere.infor) < 0) {
                    parcurgere = parcurgere.prev;
                    Nod nou = new Nod(x);
                    nou.next = parcurgere.next;
                    parcurgere.next = nou;
                    nou.prev = parcurgere;
                    nou.next.prev = nou;
                    nr++;
                    return;

                }
                parcurgere = parcurgere.next;
            }
        }
    }

    public String toString() {
        String a = "";
        Nod parcurgere = head;
        for (int i = 0; i < nr; i++) {
            a += parcurgere.infor;
            System.out.println(parcurgere.infor + " --- ");
            a += "  ";
            parcurgere = parcurgere.next;
        }
        return a;

    }

}

public class temaTap {

    public static void main(String[] args) {
        // lista: sa aibe elemente comparabile (lista ordonata)
        // sa aibe iterator
        lista<Integer> test = new lista<Integer>();
        test.add(10);
        System.out.println(test);
        test.add(20);
        System.out.println(test);
        test.add(15);
        System.out.println(test);
    }

}