A binary tree is given in level order as characters: S is an alive node, D is a dead node with no children, and X marks a missing child. Each S consumes the next two entries as its left and 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.