Spanning tree uses spanning tree algorithm to find redundant links in the LAN by selecting the best paths. It puts all the links in either forwarding or blocking state. The links without a redundant link and the best links with a redundant link would be in the forwarding state. The redundant links that were not as good as the selected links would be in the blocking state.