Codes done in the Course of Advanced Data Structures and Algorithms (ADS) : selection_sort, bubble_sort, insertion_sort : using linked_list; 2-D matrices using linked lists : matrix addition and matrix multiplication; Dijkstra's algorithm : using min heap and routing table; Prim’s algorithm : using min heap and MST table; In-place Merge Sort : using linked list; AVL tree : add_node, remove_node 2-3-4 tree : add_node, remove_node; AVL Tree - height_adjustment; merge_function - using linked list
