- A tree is connected, acyclic graph having $n$ vertices and $n-1$ edges. All these points are the basic property of a tree.
- A bipartite graph is 2 colorable structures, and every tree is 2 colorable so every tree is a bipartite graph. Another way is a graph is called bipartite if it has no cycle of odd length. since the tree is an acyclic graph so it’s bipartite.
Here option B is wrong because the tree is an acyclic data structure.
For more understanding please refer here: Tree