In a binary tree where root is 0, a parent 0 has children (left: 0, right: 1) and a parent 1 has children (left: 1, right: 0), find the value of the kth node at the Nth level.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.