data-structures-js/BreathDepthFirst.js at master · LIGL06/data-structures-js · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
const tree = {
    "10": {
        value: "10",
        left: "4",
        right: "17",
    },
    "4": {
        value: "4",
        left: "1",
        right: "9",
    },
    "17": {
        value: "17",
        left: "12",
        right: "18",
    },
    "1": {
        value: "1",
        left: null,
        right: null,
    },
    "9": {
        value: "9",
        left: null,
        right: null,
    },
    "12": {
        value: "12",
        left: null,
        right: null,
    },
    "18": {
        value: "18",
        left: null,
        right: null,
    },
};
const BreadthFirstSearch = (tree, rootNode, searchValue) => {
    let queue = [];
    queue.push(rootNode);

    while (queue.length > 0) {
        let currentNode = queue[0];
        console.log("Current node is:" + currentNode.value);
        if (currentNode.value === searchValue) {
            console.log("Found it!");
            return;
        }
        if (currentNode.left !== null) {
            queue.push(tree[currentNode.left]);
        }
        if (currentNode.right !== null) {
            queue.push(tree[currentNode.right]);
        }
        queue.shift();
    }
    console.log("Sorry, no such node found :(");
};