Meta Interview Question
Convert a binary tree to a circularly doubly linked list. head->prev = tail node. tail->next = head node. Do not use any other data structures. Must be done on the tree itself.
Convert a binary tree to a circularly doubly linked list. head->prev = tail node. tail->next = head node. Do not use any other data structures. Must be done on the tree itself.
Check out your Company Bowl for anonymous work chats.