forked from bayulaxana/data_structure_implementation
-
Notifications
You must be signed in to change notification settings - Fork 45
Home
Bayu Laksana edited this page Mar 28, 2020
·
7 revisions
Modul Struktur Data ini ditulis oleh tim asisten struktur data sebagai penunjang kegiatan Sesi Lab dan Praktikum mata kuliah Struktur Data 2020 - Teknik Informatika ITS.
- Pengenalan Struktur Data
- Dynamic Array
- Linked List
- Stack
- Queue
- Deque (Double-Ended Queue)
- Priority Queue (L. List)
- Pengenalan "Tree"
- Binary Tree
- Binary Search Tree
- Traversal pada BST
- Inorder
- Preorder
- Postorder
- Self-Balancing BST
- AVL Tree
- Melangkah menuju C++
- Standard-Template Library Container
std::array
std::vector
std::list
std::stack
std::queue
std::deque
std::priority_queue
std::set
std::map
- Pengenalan Graf
- Traversal Graf
- Aplikasi DFS dan BFS
- Minimum Spanning Tree
- Shortest Path
Modul Struktur Data
Ditulis oleh tim Asisten Struktur Data 2020 - Teknik Informatika ITS
Modul 0
- Pengenalan Struktur Data IND | ENG
- Dynamic Array IND | ENG
- Linked List IND | ENG
- Soal Latihan IND | ENG
Modul 1
- Stack IND | ENG
- Queue IND | ENG
- Deque IND | ENG
- Priority Queue (List Based) IND | ENG
- Soal Latihan IND | ENG
Modul 2
- Pengenalan Tree IND | ENG
- Binary Search Tree IND | ENG
- Traversal BST IND | ENG
- Soal Latihan IND | ENG
Modul 3
Modul 4
- Melangkah Menuju C++ | ENG
- Standard Template Library Container | ENG
- Pengenalan Graf | ENG
- Traversal Graf | ENG
Modul 5