An undirected tree with edges of length edges[i]
You are also given a guesses, where guesses[j] k.
When a node is chosen as the root of the tree, every edge in the tree becomes directed away from that root. A guess guesses[j]
Return the total number of possible root nodes that result in at least k correct guesses.
Constraints:
edges.length
guesses.length
edges represents a valid tree.
guesses[j] is an edge of the tree.
guesses contains unique elements.
k guesses.length
An undirected tree with edges of length edges[i]
You are also given a guesses, where guesses[j] k.
When a node is chosen as the root of the tree, every edge in the tree becomes directed away from that root. A guess guesses[j]
Return the total number of possible root nodes that result in at least k correct guesses.
Constraints:
edges.length
guesses.length
edges represents a valid tree.
guesses[j] is an edge of the tree.
guesses contains unique elements.
k guesses.length