Given a binary tree, return its boundary traversal in anticlockwise order: root, left boundary (excluding leaves), leaf nodes, and right boundary (excluding leaves in reverse order). Also consider the…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.