A. Use the property that bipartite graphs have no odd-length cycles.
If you know the theorem that lists equivalent definitions of trees, you know trees are graphs that are acyclic. Being acyclic implies there cannot be any cycles in the graph, including odd-length cycles. Therefore, every tree is a bipartite graph. TRUE
B FALSE
C TRUE
D TRUE
Answer B