breadthFirstSearch AlgoExpert Implementation

breadthFirstSearch.js

function breadthFirstSearch(array) {
    const queue = [this]
		while (queue.length) {
			const current = queue.shift()
			array.push(current.name)
			for (const child of current.children) {
				queue.push(child)
			}
		}
		return array
}

See BST Breadth First Traversal