Q1. Write down a C program for the shortest path by using Dijkstra’s algorithm.
Q2. Write down a C program for the Radix sort and describe its time complexity.
Q3. Describe the B-tree and write down a C program for inserting and deleting the nodes in B-tree.
Q4. Write down a C program for the Depth first search algorithm.
Q5. Describe the Height balanced trees.
Q6. Write down the C functions for implementing Queues by using the linked lists.