Singly Linked List Cpp Program, Linked List - Basics to algorithm part 3.

Linked List

Basics to algorithm part 3

In this post we will learn some algorithms of how to carry out the operations in Different types of linked list and we will learn different approaches to them. This post will be discussing about Operations on singly linked list. 

Singly Linked List:

Singly linked list supports various operations. some of the basic operations done in singly linked list is Searching of a node, Addition of a node and deletion of a node.

CPP code for Linked List.

	//
	// main.cpp
	// LinkedListBasic
	//
	// Created by Sarvesh Bhatnagar on 03/05/19.
	//
	#include <iostream>
	#define out std::cout
	#define endl std::endl
	int count = 0;
	class List{
	int id;
	List *next;
	public:
	List() : id(count),next(NULL){count+=1;}
	void setNext(List *n){next = n;}
	List * getNext(){return next;}
	int getId(){return id;}
	void setId(int myid){id = myid;}
	~List(){out<<"Destroyed "<<id<<endl;}
	}*temp(NULL),*first(NULL),*last(NULL);
	namespace linkedList {
	/* Prints the linked list if it exists.*/
	void print(){
	temp = first;
	if (temp != NULL) {
	while (temp != NULL) {
	out<<temp->getId()<<endl;
	temp = temp->getNext();
	}
	}
	}
	/* Adds a node in Linked List */
	void add(){
	List *a = new List();
	if (first == NULL) {
	first = a;
	}else{
	last->setNext(a);
	}
	last = a;
	}
	/* Adds N nodes in Linked List */
	void add(int n){
	for (int i = 0; i<n; i++) {
	add();
	}
	}
	/* Destroys the created List if any. */
	void destroy(){
	List *temp1 = NULL;
	temp = first;
	if (first != NULL) {
	while (temp != NULL) {
	temp1 = temp;
	temp = temp->getNext();
	delete temp1;
	}
	}
	}
	/* Simple Search which returns the List pointer of a particular id & saves previous
	element's pointer in temp. */
	List * search(int n){
	List* temp1 = first;
	temp = NULL;
	while (temp1 != NULL) {
	if (temp1->getId() == n) {
	return temp1;
	}
	temp = temp1;
	temp1 = temp1->getNext();
	}
	return NULL;
	}
	/*Destroys the element where id = n ; */
	void destroy(int n){
	List* temp1 = search(n);
	if (temp1 == first) {
	first = temp1->getNext();
	}else if (temp1 == last){
	last = temp;
	temp->setNext(NULL);
	}else{
	temp->setNext(temp1->getNext());
	}
	delete temp1;
	}
	}
	int main(int argc, const char * argv[]) {
	linkedList::add(4);
	out<<"started"<<endl;
	linkedList::print();
	linkedList::destroy(3);
	linkedList::print();
	out<<"Ended"<<endl;
	linkedList::destroy();
	out<<"Destroyed"<<endl;
	return 0;
	}

view raw LinkedList.cpp hosted with ❤ by GitHub

-Written by, Sarvesh Bhatnagar

Multiply Linked List

Singly Linked List Introduction

Implementation of Singly Linked List(STACK)