algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

merge: Let traverseLevel return early if node is null (#878)

Browse Source
This commit is contained in:
Worldwidebrine
2022-01-24 17:43:48 +08:00
committed by GitHub
parent 7dd99c1c03
commit 31b06c9abe
1 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
Trees/BreadthFirstTreeTraversal.js
View File

@ -19,7 +19,7 @@ class BinaryTree {
breadthFirst () { breadthFirst () {
const h = this.getHeight(this.root) const h = this.getHeight(this.root)
for (let i = 1; i <= h; i++) { for (let i = 0; i !== h; i++) {
this.traverseLevel(this.root, i) this.traverseLevel(this.root, i)
} }
return this.traversal return this.traversal
@ -27,23 +27,23 @@ class BinaryTree {
// Computing the height of the tree // Computing the height of the tree
getHeight (node) { getHeight (node) {
if (node == null) { if (node === null) {
return 0 return 0
} else {
const lheight = this.getHeight(node.left)
const rheight = this.getHeight(node.right)
return lheight > rheight ? lheight + 1 : rheight + 1
} }
const lheight = this.getHeight(node.left)
const rheight = this.getHeight(node.right)
return lheight > rheight ? lheight + 1 : rheight + 1
} }
traverseLevel (node, level) { traverseLevel (node, levelRemaining) {
if (level === 1 && node !== null) { if (node === null) {
return
}
if (levelRemaining === 0) {
this.traversal.push(node.data) this.traversal.push(node.data)
} else { } else {
if (node !== null) { this.traverseLevel(node.left, levelRemaining - 1)
this.traverseLevel(node.left, level - 1) this.traverseLevel(node.right, levelRemaining - 1)
this.traverseLevel(node.right, level - 1)
}
} }
} }
} }