Praktikum Algoritma & Struktur Data

Praktikum ASDPraktikum Algoritma & Struktur Data Login

Butuh Bantuan Asisten?

cpp

void Soal(List *L) {
    address tmp;
    tmp = (*L).first;

    cout << a? << endl; // Hasil = 7
    cout << b? << endl; // Hasil = 0x123f10
    cout << c? << endl; // Hasil = 2

    tmp = ((tmp->next)->next)->next;
    cout << d? << endl; // Hasil = 2
    cout << e? << endl; // Hasil = 0x12beebo

    tmp = (*L).first;
    (tmp->next)->next = ((tmp->next)->next)->next;
    cout << f? << endl; // Hasil = 4
    cout << g? << endl; // Hasil = 0xebbf30
    cout << h? << endl; // Hasil = 0x123f10
    cout << i? << endl; // Hasil = 0xdefed0

    ((tmp->next)->next)->next = ((((*L).first)->next)->next)->next;
    cout << j? << endl; // Hasil = 9
}

cpp

void Soal(List *L) {
    address tmp;
    tmp = (*L).first;

    cout << a? << endl; // Hasil = 5
    cout << b? << endl; // Hasil = 0xccdd20
    cout << c? << endl; // Hasil = 7

    tmp = ((tmp->next)->next)->next;
    cout << d? << endl; // Hasil = 7
    cout << e? << endl; // Hasil = 0x3344bb

    tmp = (*L).first;
    (tmp->next)->next = ((tmp->next)->next)->next;
    cout << f? << endl; // Hasil = 3
    cout << g? << endl; // Hasil = 0xaabb10
    cout << h? << endl; // Hasil = 0xccdd20
    cout << i? << endl; // Hasil = 0x1122aa

    ((tmp->next)->next)->next = ((((*L).first)->next)->next)->next;
    cout << j? << endl; // Hasil = 2
}

Lihat Kunci Jawaban Soal 3

cpp

void DeleteMiddle(List *L) {
    if (L->first == NULL || L->first->next == NULL) return;

    // Hitung panjang
    int len = 0;
    address tmp = L->first;
    while (tmp != NULL) { len++; tmp = tmp->next; }

    int midPos = len / 2;

    if (midPos == 0) {
        address del = L->first;
        L->first = L->first->next;
        delete del;
        return;
    }

    tmp = L->first;
    for (int i = 0; i < midPos - 1; i++) tmp = tmp->next;

    address del = tmp->next;
    tmp->next = del->next;
    delete del;
}

UTS — Single Linked List

Soal 1

Soal 2

Soal 3