| 1 | [DST01A-ID] Introdution to Linked list 2018-10-09 |
Play |
| 2 | [DST02A-ID] Single Linked List 1 2018-10-09 |
Play |
| 3 | [DST02B-ID] Single Linked List 2 2018-10-09 |
Play |
| 4 | [DST03A-ID] Double Linked List 1 2018-10-09 |
Play |
| 5 | [DST03B-ID] Double Linked List 2 2018-10-09 |
Play |
| 6 | [DST05A-ID] Graph - MST 2018-10-09 |
Play |
| 7 | [DST04A-ID] B-Tree 2018-10-09 |
Play |
| 8 | [DST06A-ID] Hashing - Hash Function 2018-10-09 |
Play |
| 9 | [DST05B-ID] Graph - Shortest Path 2018-10-09 |
Play |
| 10 | [DST06B-ID] Hashing - Collision 2018-10-09 |
Play |
[DST] Data Structure
![[DST] Data Structure](https://pbcdn1.podbean.com/imglogo/dir-logo/657894/657894_300x300.jpg){kind=logo}
Credit title: Subject Matter Expert : 1. Irene Anindaputri Iswanto, S.Kom., M.Sc.Eng. 2. Fidelson Tanzil, S.Kom., M.TI Dokumenter: Binus University Uploaded by: Knowledge Management and Innovation Binus University
