How can I apply bipartite coloring to an undirected tree in JavaScript?

We've already explored how to build an undirected tree from edges and how to traverse it using DFS or BFS. Now, let's look at how to apply bipartite coloring to an undirected tree in JavaScript, ensuring that no two adjacent nodes share the same color.
@Quick refresher
Bipartite coloring is a way of coloring the nodes of a graph such that no two adjacent nodes share the same color. In the case of an undirected tree, this means that each level of the tree can be colored with a different color, ensuring that no two adjacent nodes (parent and child) share the same color.
Note that this is always possible for trees, as they are acyclic and connected graphs. The simplest way to achieve bipartite coloring is to use two colors, often represented as 0 and 1.
Given the example presented in past articles, we can visualize the undirected tree as follows, with two colors applied:

const edges = [ [0, 1], [0, 2], [2, 3], [2, 4] ];

const graphMap = new Map([
  [0, [1, 2]],
  [1, [0]],
  [2, [0, 3, 4]],
  [3, [2]],
  [4, [2]]
]);

Bipartite coloring is a way of coloring the nodes of a graph such that no two adjacent nodes share the same color. In the case of an undirected tree, this means that each level of the tree can be colored with a different color, ensuring that no two adjacent nodes (parent and child) share the same color.
Note that this is always possible for trees, as they are acyclic and connected graphs. The simplest way to achieve bipartite coloring is to use two colors, often represented as 0 and 1.
Given the example presented in past articles, we can visualize the undirected tree as follows, with two colors applied:
!Undirected Tree Bipartite Coloring visualization
This tree would correspond to the following edges array and Map representation:
To implement bipartite coloring, we can use a simple DFS or BFS traversal algorithm. We'll maintain a colors map to store the color of each node as we traverse the tree. I prefer using BFS for this task, as it allows us to color the nodes level by level.

From 30-seconds-of-code: undirected-tree-bipartite-coloring