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

Created Tree Section + Moved Tree algorithm from into the folder (#236)

Browse Source
This commit is contained in:
Tapajyoti Bose
2020-07-28 21:46:56 +05:30
committed by GitHub
parent 8a9ea57f01
commit 0fd1a19ba5
1 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

76
Graphs/DepthFirstSearch.js
View File

@ -1,76 +0,0 @@
/*
* Author: Surendra Kumar
* DFS Algorithm implementation in JavaScript
* DFS Algorithm for traversing or searching graph data structures.
*/
function traverseDFS (root) {
const stack = [root]
const res = []
while (stack.length) {
const curr = stack.pop()
res.push(curr.key)
if (curr.right) {
stack.push(curr.right)
}
if (curr.left) {
stack.push(curr.left)
}
}
return res.reverse()
}
function searchDFS (tree, value) {
var stack = []
stack.push(tree[0])
while (stack.length !== 0) {
for (let i = 0; i < stack.length; i++) {
var node = stack.pop()
if (node.value === value) {
return node
}
if (node.right) {
stack.push(tree[node.right])
}
if (node.left) {
stack.push(tree[node.left])
}
}
}
return null
}
var tree = [
{ value: 6, left: 1, right: 2 },
{ value: 5, left: 3, right: 4 },
{ value: 7, left: null, right: 5 },
{ value: 3, left: 6, right: null },
{ value: 4, left: null, right: null },
{ value: 9, left: 7, right: 8 },
{ value: 2, left: 9, right: null },
{ value: 8, left: null, right: null },
{ value: 10, left: null, right: null },
{ value: 1, left: null, right: null }
]
searchDFS(tree, 9)
searchDFS(tree, 10)
traverseDFS(6)
// 6
// / \
// 5 7
// / \ \
// 3 4 9
// / / \
// 2 8 10
// /
// 1