Given a binary tree, a target level, and an index, return the node at that specific position. Assume the tree is indexed level-by-level from left to right.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.