## 100118. Maximum Score After Applying Operations on a Tree Solution leetcode

100118. Maximum Score After Applying Operations on a Tree User Accepted:0 User Tried:0 Total Accepted:0 Total Submissions:0 Difficulty:Medium There is an undirected tree with n nodes labeled from 0 to n – 1, and rooted at node 0. You are given a 2D integer array edges of length n – 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree. You … Read more