The Breadth First Search bear in mind is a type of algorithm used during tree traversing. Algorithm begins with root node and moves to next level after all nodes at the specific level are visited. It uses a queue in a ‘First In First Out’ basis to remember the nodes that are to be visited. In simplified terms, it employs a level-wise order of visiting nodes. It starts off by placing the root of the tree in a queue, processing the nodes within the queue while proceeding to place the children nodes in the queue. All nodes of all levels will be visited and this achieves a tree traversal that is level-order in type.