3241. Time Taken to Mark All Nodes

There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that there is an edge between nodes ui and vi in the tree. Initially, all nodes are unmarked. For each node i: - If i is odd, the node will get marked at time x if there is at least one node adjacent to it which was marked at time x - 1. -