Breadth First Traversal

program for BFS using adjacency matrix
Binary Search Tree

menu driven program for implementing BST using linked list.
MENU
1. Insert
2. Delete
3. Preorder
4. Inorder
5. Postorder
6. Search
7. Exit
Depth First Search

program for DFS using adjacency matrix
Dijkstra's Algorithm

program for implementing Dijkstra's algorithm using adjacency matrix and
priority queue