I am unsure how to approach this problem:
Prove that an undirected graph is bipartite if and only if there are no edges between nodes at the same level in its BFS tree. (An undirected graph is defined to be bipartite if its nodes can be divided into two sets X and Y such that all edges have one endpoint in X and the other in Y.)
Any help would be awesome!
Thank you in advance