- To implement the stack using Array.
- To implement application of stack Infix – Postfix.
- To implement queue using array
- To implement singly linked list
- To implement doubled linked list
- To implement stack using linked list.
- To implement queue using linked list.
- To implement priority queue using array.
- To implement Binary Tree.
- To implement Binary Search Tree.
- To implement Quick sort.
- To implement merge sort.
- To implement Heap sort.
- To implement selection sort technique
- To implement insertion sort.
- To implement Hashing by linear probing technique
- To implement depth first search algorithm
- To implement breadth first search algorithm
- To implement prim’s algorithm.
- To implement Kruskal’s algorithm.
DSA Programs
Subscribe to:
Posts (Atom)
No comments:
Post a Comment