Note: In binary trees, BFS traversal is also known as the level-order traversal.
One unique advantage of BFS is its ability to find the shortest path in an unweighted graph
or a graph with uniform weights. Since BFS explores nodes level by level, the first time it
reaches a node, it has found the shortest path to that node in terms of edge count.
This property makes BFS particularly useful in scenarios where we need the shortest path in terms of the
number of edges, such as finding the minimum number of moves in a game-like grid.
However, in a weighted graph where edges have varying weights, BFS cannot guarantee the shortest path. In such cases, algorithms like Dijkstra or Bellman-Ford are necessary to take the edge weights into account and accurately compute the shortest path.