HACKERRANK - PROBLEM-SOLVING - DATA STRUCTURES SOLUTIONS
* LINKED LIST
* Print elements of Linked List
Function-
Iterative Solution-
void printLinkedList(SinglyLinkedListNode* head) {
SinglyLinkedListNode *p = head;
while(p){
cout << p->data << endl;
p = p->next;
}
return;
}
Recursive Solution-
void printLinkedList(SinglyLinkedListNode* head) {
SinglyLinkedListNode *p = head;
if(p != NULL){
cout << p->data << endl;
printLinkedList(p->next);
}
else
return;
}
Full Program-
#include <bits/stdc++.h>
using namespace std;
class SinglyLinkedListNode {
public:
int data;
SinglyLinkedListNode *next;
SinglyLinkedListNode(int node_data) {
this->data = node_data;
this->next = nullptr;
}
};
class SinglyLinkedList {
public:
SinglyLinkedListNode *head;
SinglyLinkedListNode *tail;
SinglyLinkedList() {
this->head = nullptr;
this->tail = nullptr;
}
void insert_node(int node_data) {
SinglyLinkedListNode* node = new SinglyLinkedListNode(node_data);
if (!this->head) {
this->head = node;
} else {
this->tail->next = node;
}
this->tail = node;
}
};
void free_singly_linked_list(SinglyLinkedListNode* node) {
while (node) {
SinglyLinkedListNode* temp = node;
node = node->next;
free(temp);
}
}
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode* next;
* };
*
*/
void printLinkedList(SinglyLinkedListNode* head) {
SinglyLinkedListNode *p = head;
while(p){
cout << p->data << endl;
p = p->next;
}
return;
}
int main()
{
SinglyLinkedList* llist = new SinglyLinkedList();
int llist_count;
cin >> llist_count;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
for (int i = 0; i < llist_count; i++) {
int llist_item;
cin >> llist_item;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
llist->insert_node(llist_item);
}
printLinkedList(llist->head);
return 0;
}
*Insert Node at Tail of Linked list
No comments:
Post a Comment