Given the root of a binary tree, return the level (0-indexed or 1-indexed) that contains the maximum number of nodes. If there is a tie, return the lowest level number.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.