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

feat: add tests for binary search trees (#1769)

Browse Source
This commit is contained in:
Ridge Kimani
2025-01-15 14:11:02 +03:00
committed by GitHub
parent a62a46e732
commit 1d252d7aca
2 changed files with 76 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
Data-Structures/Tree/BinarySearchTree.js
View File

@ -36,13 +36,13 @@ const Node = (function Node() {
visit(output = (value) => console.log(value)) {
// Recursively go left
if (this.left !== null) {
this.left.visit()
this.left.visit(output)
}
// Print out value
output(this.value)
// Recursively go right
if (this.right !== null) {
this.right.visit()
this.right.visit(output)
}
}
@ -116,20 +116,23 @@ const Tree = (function () {
}
// Inorder traversal
traverse() {
traverse(output = (value) => console.log(value)) {
if (!this.root) {
// No nodes are there in the tree till now
return
}
this.root.visit()
this.root.visit(output)
}
// Start by searching the root
search(val) {
const found = this.root.search(val)
if (found !== null) {
return found.value
if (this.root) {
const found = this.root.search(val)
if (found !== null) {
return found.value
}
}
// not found
return null
}