1. Suppose you have single connected linkedlist. Try to print the list from tail to head using recursive thinking.
2. Explain what is the max heap data structure?
3. Suppose I have a linkedlist data structure. Inside each node of this linkedlist in addition to the data field and the next field l store a pointer to the head of another linkedlist. Explain what this data structure is look like.
4. (Optional) write a recursive data structure to store a linkedlist. You do not allowed to create more than one structure (no class or struct or ...).