Given the root of a binary tree and an integer level, find the minimum element present at that specific level. Assume levels are 1-indexed, starting from the root.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.