Given the root of a binary tree, find the sum of the values of all leaf nodes at the minimum level, where the minimum level means the shallowest depth (root is depth 0) at which at least one leaf…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.