Skip to content

This problem highlights the basic implementations in Singly and Doubly Linked List.

License

Notifications You must be signed in to change notification settings

NushratJabenAurnima/Implementation_of_Linked_List

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

24 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Problem Statement

A series of data structures joined by links is called a linked list. A linked list is a collection of links that has objects in it. Every link has an associated link. After arrays, linked lists are the second most used type of data structure. Linked list can be visualized as a chain of nodes. There are two types of linkled list - Singly Linked List and Doubly Linked List. In SLL, every node points to the next node. Whereas in DLL, every node points to its previous node and next node.

The system allows the following features:

. User Input

. Insert data (First position, Last Position, Random)

. Display the with design

. Deleting data (First position, Last Position, Random) without memory waste

. Deleting duplicate data

. Revesing data using Linked List

The system contains the following functions:

. create()

. beginning()

. insert_random()

. delete_last()

. delete_first()

. delete_random()

. print()

. updated()

. reverse()

. duplicate()

About

This problem highlights the basic implementations in Singly and Doubly Linked List.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Languages