Given the root of a binary tree, a target node, and an integer K, remove all nodes located at distance K from the target node. Note that no parent pointers are provided in the tree structure.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.