What is the process of traversing a binary tree level by level, starting from the root node, known as?

The process of traversing a binary tree level by level, starting from the root node, is known as breadth-first search (BFS).