Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork5.8k
Level order traversal#1809
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
aniket866 wants to merge5 commits intoTheAlgorithms:masterChoose a base branch
base:master
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
+458 −248
Open
Changes fromall commits
Commits
Show all changes
5 commits Select commitHold shift + click to select a range
fe63ab2 Add Morris Inorder Traversal algorithm with tests
aniket866b8f2105 Implemented Morris Traversal v2
aniket866318ff27 Add Level Order Traversal algorithm with Vitest tests
aniket8669aeef45 Delete Trees/MorrisTraversal.js
aniket86673c7d41 Delete Trees/test/MorrisTraversal.test.js
aniket866File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,35 @@ | ||
| /** | ||
| * Level Order Traversal of a Binary Tree (Breadth-First Traversal) | ||
| */ | ||
| export class Node { | ||
| constructor(value) { | ||
| this.value = value; | ||
| this.left = null; | ||
| this.right = null; | ||
| } | ||
| } | ||
| export function levelOrderTraversal(root) { | ||
| if (!root) return []; | ||
| const result = []; | ||
| const queue = [root]; | ||
| while (queue.length > 0) { | ||
| const levelSize = queue.length; | ||
| const currentLevel = []; | ||
| for (let i = 0; i < levelSize; i++) { | ||
| const node = queue.shift(); | ||
| currentLevel.push(node.value); | ||
| if (node.left) queue.push(node.left); | ||
| if (node.right) queue.push(node.right); | ||
| } | ||
| result.push(currentLevel); | ||
| } | ||
| return result; | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,32 @@ | ||
| import { Node, levelOrderTraversal } from "../LevelOrderTraversal.js"; | ||
| describe("Level Order Traversal", () => { | ||
| test("should return empty array for empty tree", () => { | ||
| expect(levelOrderTraversal(null)).toEqual([]); | ||
| }); | ||
| test("should return single node tree", () => { | ||
| const root = new Node(1); | ||
| expect(levelOrderTraversal(root)).toEqual([[1]]); | ||
| }); | ||
| test("should return correct level order for complete tree", () => { | ||
| const root = new Node(1); | ||
| root.left = new Node(2); | ||
| root.right = new Node(3); | ||
| root.left.left = new Node(4); | ||
| root.left.right = new Node(5); | ||
| root.right.left = new Node(6); | ||
| root.right.right = new Node(7); | ||
| expect(levelOrderTraversal(root)).toEqual([[1], [2, 3], [4, 5, 6, 7]]); | ||
| }); | ||
| test("should handle unbalanced tree", () => { | ||
| const root = new Node(1); | ||
| root.left = new Node(2); | ||
| root.left.left = new Node(3); | ||
| expect(levelOrderTraversal(root)).toEqual([[1], [2], [3]]); | ||
| }); | ||
| }); |
Oops, something went wrong.
Uh oh!
There was an error while loading.Please reload this page.
Oops, something went wrong.
Uh oh!
There was an error while loading.Please reload this page.
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.