Given a linked list, reverse it and return. I/P: 1->2->3->4->5 O/P: 5->4->3->2->1 Explanation: Iterative Approach TC: O(n) SC:O(1) /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0)…

Node class class Node{ public: int data; Node *prev; Node *next; Node(int data){ this->data = data; this->prev = NULL; this->next = NULL; } }; Insert At Head void insertAtHead(Node* &head,int data) { //step:1 Node creation Node* newNode = new Node(data)…

In linked list, we have a node. Each node has one data member, and one Node* next pointer which stores the address of the next node. If there’s no next node then it will have NULL stored. Node: class Node{ public: int data; Node*…