LIST OF EXPERIMENTS
1 Create a Stack and do the following operations using arrays and linked lists
(i) Push (ii) Pop (iii) Peep
2 Create a Queue and do the following operations using arrays and linked lists
(i) Add (ii) Remove
3. Implement the operations on singly linked list, doubly linked list and circular
linked list.
4 Create a binary search tree and do the following traversals
(i) In-order (ii) Pre order (iii) Post order
5. Implement the following operations on a binary search tree.
(i) Insert a node (ii) Delete a node
6 Sort the given list of numbers using heap and quick sort.
7. Perform the following operations in a given graph
(i) Depth first search (ii) Breadth first search
8 Find the shortest path in a given graph using Dijkstra algorithm