You are given a binary tree where each node has a `left`, `right`, and `next` pointer. Populate each `next` pointer to point to its immediate right node on the same level. If there is no right node…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.