Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node. The tree is undirected for the purpose of distance.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.