Breadth First Search (BFS) In C

Tree Traversal : Breadth First Search (BFS)

Breadth-first search (BFS) in C is an algorithm for traversing or searching tree data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a search key and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
Breadth First Search (BFS) In C-1

Breadth First Search (BFS) In C

Breadth First Search (BFS) in C

Steps for Breadth First Search Tree Treaversal

  • Step 1 : Push the root i.e. 50 to the queue.
  • Step 2 : Pop the element 50 from the queue and print it.
  • Step 3 : Now, Add it’s left and right child i.e. add 30 and 70 to queue.
  • Step 4 : Again pop the front element i.e. 30 from queue and print it .
  • Step 5 :  Add it’s left and right child i.e. 10 and 40 in the queue.
  • Step 6 : Pop the element 70 from the queue and  print it.
  • Step 7 : add it’s left and right child i.e. 60 and 90.
  • Step 8 : Now pop all the elements from the queue and print them as there is no child of these elements.
      Therefore the printing sequence will be 50 30 70 10 40 60 90 .

Algorithm

  1. If the root is NULL, return.
  2. Otherwise push the root in queue.
  3. Pop the node from the queue.
  4. Print the node’s data and add its left and right child.
  5. Repeat until the queue is empty.

Implementation of Breadth First Search In C

Run
#include <stdio.h>
#include <stdlib.h>

#define MAX_QUEUE_SIZE 100

typedef struct Node
{
  int value;
  struct Node *left;
  struct Node *right;
} Node;

typedef struct Queue
{
  Node *items[MAX_QUEUE_SIZE];
  int front;
  int rear;
} Queue;

void enqueue (Queue * q, Node * item)
{
  if (q->rear == MAX_QUEUE_SIZE - 1)
    {
      printf ("Queue Overflow\n");
      exit (EXIT_FAILURE);
    }
  q->rear++;
  q->items[q->rear] = item;
}

Node *dequeue (Queue * q)
{
  if (q->front == q->rear)
    {
      printf ("Queue Underflow\n");
      exit (EXIT_FAILURE);
    }
  q->front++;
  return q->items[q->front];
}

int
is_empty (Queue * q)
{
  return q->front == q->rear;
}

void bfs (Node * root)
{
  Queue q;
  q.front = -1;
  q.rear = -1;

  enqueue (&q, root);

  while (!is_empty (&q))
    {
      Node *current = dequeue (&q);
      printf ("%d ", current->value);

      if (current->left != NULL)
	{
	  enqueue (&q, current->left);
	}
      if (current->right != NULL)
	{
	  enqueue (&q, current->right);
	}
    }
}

int main ()
{
  Node *root = (Node *) malloc (sizeof (Node));
  root->value = 1;

  Node *node1 = (Node *) malloc (sizeof (Node));
  node1->value = 2;

  Node *node2 = (Node *) malloc (sizeof (Node));
  node2->value = 3;

  Node *node3 = (Node *) malloc (sizeof (Node));
  node3->value = 4;

  Node *node4 = (Node *) malloc (sizeof (Node));
  node4->value = 5;

  Node *node5 = (Node *) malloc (sizeof (Node));
  node5->value = 6;

  root->left = node1;
  root->right = node2;
  node1->left = node3;
  node1->right = node4;
  node2->left = node5;
  node2->right = NULL;
  node3->left = NULL;
  node3->right = NULL;
  node4->left = NULL;
  node4->right = NULL;
  node5->left = NULL;
  node5->right = NULL;

  bfs (root);

  return 0;
}

Output:

1 2 3 4 5 6 

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription

Introduction to Trees

Binary Trees

Binary Search Trees

Traversals

  • Traversal in Trees
  • Tree Traversals: Breadth-First Search (BFS) : C | C++ | Java
  • Tree Traversals: Depth First Search (DFS) : C | C++ | Java
  • Construct a Binary Tree from Postorder and Inorder

B – Trees

AVL Trees

  • AVL Trees
    • AVL Trees: Introduction
    • AVL Tree Insertion : C | C++ | Java
    • AVL Tree Deletion : C | C++ | Java
    • Insertion in a Binary Tree (Level Order) – C | C++ | Java
    • Searching in Binary Tree – C | C++ | Java
    • Searching in a Binary Search Tree – C | C++ | Java

Complete Programs for Trees

  • Depth First Traversals – C | C++ | Java
  • Level Order Traversal – C | C++Java
  • Construct Tree from given Inorder and Preorder traversals – C | C++Java
  • Construct Tree from given Postorder and Inorder traversals – C | C++Java
  • Construct Tree from given Postorder and Preorder traversal – C | C++Java
  • Find size of the Binary tree – C | C++Java
  • Find the height of binary tree – C | C++Java
  • Find maximum in binary tree – C | C++Java
  • Check whether two tree are identical- CC++Java
  • Spiral Order traversal of Tree- CC++Java
  • Level Order Traversal Line by Line – C | C++Java
  • Hand shaking lemma and some Impotant Tree Properties.
  • Check If binary tree if Foldable or not.- CC++Java
  • check whether tree is Symmetric – C| C++Java.
  • Check for Children-Sum in Binary Tree- C|C++Java
  • Sum of all nodes in Binary Tree- CC++ | Java
  • Lowest Common Ancestor in Binary Tree- CC++ | Java

Introduction to Trees

Binary Trees

Binary Search Trees

Traversals

  • Traversal in Trees
  • Tree Traversals: Breadth-First Search (BFS) : C | C++ | Java
  • Tree Traversals: Depth First Search (DFS) : C | C++ | Java
  • Construct a Binary Tree from Postorder and Inorder

B – Trees

AVL Trees

  • AVL Trees
    • AVL Trees: Introduction
    • AVL Tree Insertion :  C | C++ | Java
    • AVL Tree Deletion : C | C++ | Java
    • Insertion in a Binary Tree (Level Order) – C | C++ | Java
    • Searching in Binary Tree – C | C++ | Java
    • Searching in a Binary Search Tree – C | C++ | Java

Complete Programs for Trees

  • Depth First Traversals – C | C++ | Java
  • Level Order Traversal – C | C++Java
  • Construct Tree from given Inorder and Preorder traversals – C | C++Java
  • Construct Tree from given Postorder and Inorder traversals – C | C++Java
  • Construct Tree from given Postorder and Preorder traversal – C | C++Java
  • Find size of the Binary tree – C | C++Java
  • Find the height of binary tree – C | C++Java
  • Find maximum in binary tree – C | C++Java
  • Check whether two tree are identical- CC++Java
  • Spiral Order traversal of Tree- CC++Java
  • Level Order Traversal LIne by Line – C | C++Java
  • Hand shaking lemma and some Impotant Tree Properties.
  • Check If binary tree if Foldable or not.- CC++Java
  • check whether tree is Symmetric  C| C++Java.
  • Check for Children-Sum in Binary Tree- C|C++Java
  • Sum of all nodes in Binary Tree- CC++ | Java
  • Lowest Common Ancestor in Binary Tree. CC++ | Java