[PR #1392] [CLOSED] Implemented Level order traversal #1991

New Issue

claunia · 2026-01-29T15:27:11Z

claunia commented

2026-01-29 15:27:11 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/1392
Author: @di-was
Created: 5/10/2024
Status: ❌ Closed

Base: master ← Head: levelorder_traversal

📝 Commits (1)

849792b Level order traversal added

📊 Changes

1 file changed (+51 additions, -0 deletions)

View changed files

➕ data_structures/binary_trees/level_order_traversal.c (+51 -0)

📄 Description

Description of Change

Added a detailed implementation of level order traversal, also known as Breadth-First Search (BFS), for a binary tree. The provided code systematically traverses every node in the tree, visiting all nodes at a particular level before moving to the next level. It starts from the root node and explores all of its neighbors at the present depth level before moving to the nodes at the next level.

Checklist

Added description of change
Added file name matches File name guidelines
Relevant documentation/comments is changed or added
PR title follows semantic commit guidelines
Search previous suggestions before making a new one, as yours may be a duplicate.
I acknowledge that all my contributions will be made under the project's license.

Notes: BFS

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/1392 **Author:** [@di-was](https://github.com/di-was) **Created:** 5/10/2024 **Status:** ❌ Closed **Base:** `master` ← **Head:** `levelorder_traversal` --- ### 📝 Commits (1) - [`849792b`](https://github.com/TheAlgorithms/C/commit/849792b700e451857b46c22e5f6f983e99af506f) Level order traversal added ### 📊 Changes **1 file changed** (+51 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `data_structures/binary_trees/level_order_traversal.c` (+51 -0) </details> ### 📄 Description #### Description of Change Added a detailed implementation of level order traversal, also known as Breadth-First Search (BFS), for a binary tree. The provided code systematically traverses every node in the tree, visiting all nodes at a particular level before moving to the next level. It starts from the root node and explores all of its neighbors at the present depth level before moving to the nodes at the next level.  #### Checklist  - [x] Added description of change - [x] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [x] Relevant documentation/comments is changed or added - [x] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x] Search previous suggestions before making a new one, as yours may be a duplicate. - [x] I acknowledge that all my contributions will be made under the project's license. Notes: BFS --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:27:11 +00:00

claunia closed this issue

2026-01-29 15:27:11 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#1991