breadth first search

class Node {
    constructor (val) {
        this.value = val;
        this.children = [];
    }
}

function breadthFirstSearch (seek,node) {
    if (seek === node.value) return node;
    const queue = [node];
    const path = {};

    while (queue.length > 0) {
        const queuedNode = queue.shift();
        if (seek === queuedNode.value) {
            let currentNode = queuedNode;
            const pathToRoot = [];

            while (currentNode) {
                pathToRoot.push(currentNode);
                currentNode = path[currentNode.value];
            }

            return pathToRoot;
        }

        for (let i=0; i<queuedNode.children.length; i++) {
            const child = queuedNode.children[i];
            path[child.value] = queuedNode;
            queue.push(child);
        }
    }

    return -1;
}

const tree = new Node(5);
tree.children.push(new Node(3));
tree.children.push(new Node(4));
tree.children.push(new Node(6));
tree.children[0].children.push(new Node(1));
tree.children[0].children.push(new Node(2));
tree.children[2].children.push(new Node(7));
tree.children[2].children.push(new Node(8));
tree.children[2].children.push(new Node(9));

console.log("Breadth First Search");
console.log(1, breadthFirstSearch(1, tree));//.map(obj => obj.value));
console.log(9, breadthFirstSearch(9, tree));//.map(obj => obj.value));
console.log(12, breadthFirstSearch(12, tree));