DEKLARASI NODE: struct Node { .... ____ ____; .... Node ____; }; int main(){ .... Node ____ = ____; .... return ____; } TAMBAH NODE DI AWAL: void addFirst(Node ____head, int ____){ .... Node ____nodeBaru = new Node; .... nodeBaru->____ = databaru; .... nodeBaru->____ = *head; .... *head = ____; } TAMBAH NODE DI AKHIR: void addLast(Node ____head, int databaru){ .... Node ____nodeBaru = ____ Node; .... nodeBaru -> data = ____; .... nodeBaru -> next = ____; .... // If linked list is empty: .... if (*head == NULL){ ........ *head = ____; ........ return; .... } .... // If not, then traverse to last node: .... Node ____ = ____; .... while (temp -> next ____ NULL){ ........ ____ = temp -> next .... }; .... temp -> next = nodeBaru; } TAMPILKAN LINKED LIST: void printList(struct Node ____){ ....____ (head ____ NULL){ ........ cout << "LinkedList masih kosong." << endl; ........ return; ....} .... ____ (head ____ NULL){ ........ cout << ____ -> ____ << " "; ........ head = head -> ____; .... } .... cout << endl; } HAPUS NODE AWAL: void ____(Node ____head){ .... if (head == NULL){ ........ cout << "LinkedList masih kosong." << endl; ........ return; .... } .... ____head = ____ -> ____; .... } HAPUS NODE AKHIR: void ____(Node ____head){ .... if (head == NULL){ ........ cout << "LinkedList masih kosong." << endl; ........ return; .... } .... if ((____) -> next ____ NULL){ ........ *head = NULL; ........ return; .... } .... Node ____ = ____head; .... while (____ ____ NULL){ ........ ____ = ____; .... } .... temp -> next = NULL; } UBAH NODE: void ubahData(Node **head){ .... if (*head == NULL){ ........ cout << "LinkedList masih kosong" << endl; ........ return; .... } .... int angkaYangMauDiganti; .... cout << "Masukan data yang akan diubah : "; cin >> angkaYangMauDiganti; .... Node ____ = ____; .... while (____ ____ ____){ ........ if (temp -> data ____ angkaYangMauDiganti){ ............ cout << "Masukan data yang baru : "; ............ cin >> ____; ............ cout << "Data berhasil diubah" << endl; ............ return; ........ } ........ temp = ____; .... } .... cout << "Angka yang Anda ingin ubah tidak ditemukan." << endl; }

Node: Declaration, Show, Add, Edit, and Remove

打印
嵌入

排行榜

视觉风格

选项

切换模板

恢复自动保存：？