Data-Structures using C Language:-
1)Implementing AVL tree
2)Implementing Binary Search Tree
3)Implementing Singly Linear Linked List
4)Implementing Singly Circular Linked List
5)Implementing Doubly Linear Linked List
6)Implementing Doubly Circular Linked List
7)Implementing BFS using Adjacency List
8)Implementing BFS using Adjacency Matrix
9)Implementing DFS using Adjacency List
10)Implementing DFS using Adjacency Matrix
11)Implementing Circular queue using linked list
12)Implementing Circular queue using array
13)Implementing Heap sort using Max_Heap (Inc)
14)Implementing Heap sort using Min_Heap (Dec)
15)Deleting max element from Max_Heap
16)Deleting min element from element Min_Heap
17)Implementing Max_Heap
18)Implementing Min_Heap
19)Increasing Decreasing key in Max_Heap
20)Increasing Decreasing key in Min_Heap
21)Converting Infix to Postfix
22)Converting Infix to Prefix
23)Implementing Postfix Evaluation
24)converting Postfix to Prefix
25)Implementing Prefix Evaluation
26)Converting Prefix to Postfix
27)Implementing queue using two stacks
28)Implementing Topological sorting using Adj List
29)Implementing Topological sorting using Adj Matrix
30)Implementing Linear Probing
32)Implementing Chaining
32)Implementing Double Hashing