Given the root of a binary tree, find the level that has the maximum number of nodes and return the sum of the node values at that level. If there is a tie, return the level with the minimum sum or…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.