Given a binary tree, print all its boundary nodes in anti-clockwise direction starting from the root. The boundary includes the left boundary, leaves, and right boundary, without duplicate printing.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.