C++ Programming Tutorial


Data File Structure Programs


Insert, edit, delete, append, display, Srch. Insert, delete, merge, delete multiple occurrences Arrays as a Stack in graphics


Stack operations using array Stack using static memory allocation Stack using dynamic memory allocation Double ended link list as a stack Lnked list as a Stack Infix expr. to Postfix expr. Postfix expr. into an Infix expr. Arrays as a Stack in graphics Stack as an Arithmetic expr. Evaluater Graphical Rep. of Stack Stack to traverse - inodr, postodr, preodr


Queue using static memory allocation Queue using dynamic memory allocation Circular queue Linked list as a Queue Double Ended linked list as a Queue Graphical Rep. of Queue Arrays as a Linear Queue Array as a Circular Queue Arrays as a Linear Queue ( in graphics ) Arrays as a Circular Queue ( in graphics )

Linked List

Singly link list Circular linked list Doubly link list Linked list as a Queue Linked list as a Stack Double Ended linked list as a Queue Double Ended linked list as a Stack Infix to Postfix - Linked List as Stack Circular doubly link list Single Ended Linked List - Sorting in both odr Hashing - double ended Linked List Sort of link list


Linked List as a Binary Srch. Tree Set Class using Binary Srch. Tree Maximum depth of Binary Srch. Tree Minimum Spaning Tree Prims algo - minimum spanning tree Traverse binary tree - inodr, preodr, post Find number in binary Srch. tree display levell


Bubble Sort Selection Sort Insertion Sort Radix Sort Merge Sort Quick Sort Heap Sort Linear Sort Shell Sort Topological Sort


Linear Srch. or Sequential Srch. Binary Search Breadth First Search Traversal Depth First Search Traversal Shortest Path-Given Source-Destination-Dijkstras


Simple implementation of Hashing Hashing using double-ended Linked List Hashing using Mid-Square Method Example of Hashing n term of the fibonacci series using recursion


Factorial of the given number using recursion Mystery of Towers of Hanoi using recursion


#include <iostream.h>
#include <conio.h>
#define MAX_NODE 50

struct node{
    int vertex;
    node *next;

node *adj[MAX_NODE]; //For storing Adjacency list of nodes.
int totNodes; //No. of Nodes in Graph.

////////////Queue Operation\\\\\\\\\\\\\\\\\\\\\\\\    int queue[MAX_NODE],f=-1,r=-1;

void q_insert(int item){
    r = r+1;

int q_delete(){
    int delitem=queue[f];

int is_q_empty(){
////////////Queue Operation\\\\\\\\\\\\\\\\\\\\\\\\    
void createGraph(){
    node *newl,*last;
    int neighbours,neighbour_value;
    cout<<\"\\n\\n---Graph Creation---\\n\\n\";
    cout<<\"Enter total nodes in graph : \";
    for(int i=1;i<=totNodes;i++){
        cout<<\"\\nEnter no. of nodes in the adjacency list of node \"<<i<<\"\\n\";
        cout<<\"--> That is Total Neighbours of \"<<i<<\" : \";
        for(int j=1;j<=neighbours;j++){
            cout<<\"Enter neighbour #\"<<j<<\" : \";
            newl=new node;
                last->next = newl;
                last = newl;

void BFS_traversal(){
    node *tmp;
    int N,v,start_node,status[MAX_NODE];//status arr for maintaing status.
    const int ready=1,wait=2,processed=3; //status of node.

    cout<<\"Enter starting node : \";

    //step 1 : Initialize all nodes to ready state.
    for(int i=1;i<=totNodes;i++)

    //step 2 : put the start node in queue and change status.
    q_insert(start_node); //Put starting node into queue.
    status[start_node]=wait; //change it status to wait state.

    //step 3 : Repeat until queue is empty.

        //step 4 : Remove the front node N of queue.
        //process N and change the status of N to
        //be processed state.
        N = q_delete(); //remove front node of queue.
        status[N]=processed; //status of N to processed.
        cout<<\"   \"<<N; //displaying processed node.

        //step 5 : Add to rear of queue all the neighbours of N,
        //that are in ready state and change their status to
        //wait state.
        tmp = adj[N];  //for status updation.
            v = tmp->vertex;
            if(status[v]==ready){//check status of N\'s neighbour.
                q_insert(v); //insert N\'s neighbour who are in ready state.
                status[v]=wait; //and make their status to wait state.

void main(){
    cout<<\"*****Breadth First Search Traversal*****\\n\";
    cout<<\"\\n===BFS traversal is as under===\\n\";

    Related Post:
  1. Program to show the implementation of Bottom-Up Parsing

  2. Program to illustrate printing data on the printer

  3. Program to illustrate multiple inheritance

  4. Program to illustrate the implementation of Arithmetic Expression Evaluater accepting {} & [] also

  5. Program to illustrate the implementation of arrays as a Linear Queue

  6. Program of singly link list with different functionalities

  7. Program to illustrate the use of call-by-refrence method using pointers

  8. Program to search an element in an array using Linear search

  9. Program to illustrate unary operator (increment operator) overloading without return type

  10. Program to get possible prime numbers like number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158.Find the largest substring..

  11. Program to help Umar in this task. Represent each city by one lowercase character. Thus, you can have at most 26 different cities to visit....

  12. Program to create heap

  13. Program of singly link list

  14. Program to read a Non-Linear equation in one variable, then evaluate it using Simple Itrative Method and display its kD accurate root

  15. Program to show the 3D Shearing Transformation along x-axis

  16. Program to illustrate the Merge Sort

  17. Program to show the implementation of Hashing with Insert, Delete and search functionality using double-ended Linked List

  18. Program to print, read and calculate sum, smallest, largest element an array using pointers

  19. Program to covert a given Decimal Number into English Code

  20. Program to illustrate pointers and an array of structure

Didn't find what you were looking for? Find more on Program of Breadth First Search Traversal ( BFS )