-
Notifications
You must be signed in to change notification settings - Fork 2.1k
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 our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Tree- level order traversal in JS #2642
Merged
singh-shreya6
merged 1 commit into
jainaman224:master
from
ashishnagpal2498:treeLevelOrderTraversalJS
Apr 19, 2020
Merged
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains 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,59 @@ | ||
/*Description - Level order traveral of a tree is a traversal in which all the nodes which are at same | ||
level are explored and then we move to another level. It is implemented using a queue. The root node | ||
is pushed into queue intially and loops run till queue is not empty. The node at front is poped out | ||
and if child of that node exist then those are pushed into queue. | ||
Implementing Level Order Traversal in graph is also called Breath First Search. | ||
*/ | ||
|
||
// Creates a Tree Node with input value | ||
class Node { | ||
constructor(value) { | ||
this.value = value; | ||
this.left = null; | ||
this.right = null; | ||
} | ||
} | ||
|
||
//Level Order Traversal | ||
var traversal = function (root) { | ||
if (root === null) return root; | ||
if (root.left === null && root.right === null) { | ||
console.log(root.value); | ||
return root; | ||
} | ||
const queue = []; | ||
queue.push(root); | ||
while (queue.length > 0) { | ||
const node = queue.splice(0, 1)[0]; | ||
console.log(node.value); | ||
if (node.left) queue.push(node.left); | ||
if (node.right) queue.push(node.right); | ||
} | ||
return root; | ||
}; | ||
|
||
ashishnagpal2498 marked this conversation as resolved.
Show resolved
Hide resolved
|
||
// Sample Input | ||
var 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); | ||
|
||
// Sample Output | ||
console.log("Level Order traversal of tree is:-"); | ||
traversal(root); | ||
|
||
/* | ||
* Output | ||
* | ||
* Level Order traversal of tree is | ||
1 | ||
2 | ||
3 | ||
4 | ||
5 | ||
6 | ||
7 | ||
*/ |
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
A brief description at start of file. and one blank line after description.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
A brief description about , what is tree level order traversal ?