Upload presentasi
Presentasi sedang didownload. Silahkan tunggu
1
Lecture 10 Doubly Linked List Sandy Ardianto & Erick Pranata © Sekolah Tinggi Teknik Surabaya 1
2
» Overview » InsertAfter » RemoveLast » Exercises 2 © Sekolah Tinggi Teknik Surabaya
3
» A doubly linked list is often more convenient than single linked list » Nodes store: ˃element ˃link to the previous node ˃link to the next node » Special trailer and header nodes 3 © Sekolah Tinggi Teknik Surabaya prevnext elem node trailer header nodes/positions elements
4
» We visualize operation insertAfter(p, X), which returns position q 4 © Sekolah Tinggi Teknik Surabaya ABXC ABC ABC p X q pq
5
» We visualize remove(p), where p == last() 5 © Sekolah Tinggi Teknik Surabaya ABCD p ABC D p ABC
6
» InsertFirst » InsertLast » RemoveFirst » Reverse » BubbleSort 6 © Sekolah Tinggi Teknik Surabaya
Presentasi serupa
