Given the root of a binary tree, return the maximum width of the tree. The width of a level is the number of positions between its leftmost and rightmost non-null nodes (inclusive), counting the null…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.