# Introduction In this challenge, we will tackle a real interview question from a major tech company: breadth-first traversal of the DOM tree. The challenge requires us to write a function called `bfsDOMTree` that takes a DOM object as a parameter and returns an array containing all tag names encountered during the traversal. We will traverse the DOM tree in a breadth-first manner, visiting each level of the tree before moving on to the next level. The function must be exported and have the specific name `bfsDOMTree` in order to pass the submission.
Click the virtual machine below to start practicing