1, Given a binary tree , create a double linked list in a single tranversal 2. find x/y without using division operator in a optimal way
Anonymous
used a previous pointer and keep creating the next linked list nodes
Check out your Company Bowl for anonymous work chats.