Lets remove all duplicate elements from a sorted singly linked list.
Suppose we have a linked list and we want to reverse it in Single iteration and O(n) complexity.
Suppose we have an int array and we want to create it into a singly linked list from it.
Many times we need to search for some specific paths in a binary tree from top to bottom. Lets design a code to find out all paths in a binary tee.