📄️ Breadth-first Search
Instead of traveling depth first, the breadth first traversal traveling each level from the top of the tree to bottom. To implement this algorithm we need a queue to help us store the children node's.
📄️ Depth-first Search
It is a search algorithm for traversal the tree data structure. There are three types of Depth Search to collect each values of tree.