Given a Binary Search Tree and a target key, return a path array encoding the root-to-key traversal steps, using 0 for right and 1 for left (or vice-versa according to standard conventions, here 1 for…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.