Given a binary tree, print its boundary nodes in an anti-clockwise direction starting from the root: root, left boundary (excluding leaves), leaves, and right boundary (in reverse order).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.