Data Structure

Materials

Materials	Topics	Code
Introduction to Data Structures	`Struct` `Pointer` `Dynamic Memory Allocation`	00_intro_to_ds.cpp
Linked List	`Single Linked List` `Double Linked List`	01_single_linked_list.cpp 02_double_linked_list.cpp
Stack and Queue	`Stack` `Queue` `Priority Queue`	03_stack_and_queue.cpp 04_priority_queue.cpp
Hashing and Hash Tables	`Hash Table` `Hash Function` `Collision Handling`	05_hashtable_linear_probing.cpp 06_hashtable_chaining.cpp
Binary Search Tree	`Tree` `Binary Search Tree`	07_binary_search_tree.cpp
AVL Tree	`Binary Search Tree` `Rotation`	08_avl_tree.cpp
B-Tree	`2-3 Tree` `B-Tree`	09_b_tree.cpp
Red Black Tree	`Coloring` `Red Black Tree`	-
Heaps	`Max-Heap` `Min-Heap` `Min-Max Heap`	-
Tries	`Tries Concept` `Tries Applications`	-
Disjoint Set and Graphs	`Disjoint Sets` `Minimum Spanning Tree` `Shortest Path`	-

Name		Name	Last commit message	Last commit date
Latest commit History 40 Commits
pictures		pictures
.gitignore		.gitignore
00_intro_to_ds.cpp		00_intro_to_ds.cpp
01_single_linked_list.cpp		01_single_linked_list.cpp
02_double_linked_list.cpp		02_double_linked_list.cpp
03_stack_and_queue.cpp		03_stack_and_queue.cpp
04_priority_queue.cpp		04_priority_queue.cpp
05_hashtable_linear_probing.cpp		05_hashtable_linear_probing.cpp
06_hashtable_chaining.cpp		06_hashtable_chaining.cpp
07_binary_search_tree.cpp		07_binary_search_tree.cpp
08_avl_tree.cpp		08_avl_tree.cpp
09_b_tree.cpp		09_b_tree.cpp
README.md		README.md