Skip to content

Designed to add codes for various data structures and its application

Notifications You must be signed in to change notification settings

nitin-rjadhav/Prep-Codes

Repository files navigation

Basic codes for Linked List, Stack and Queue

This project is designed to add codes for various data structures and its application. The aim is to create a repo with various languages code implementation of Linked List, Stack and Queue along with their application.

Single Linked List

A singly linked list is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer. Reference Image

Double Linked List

A doubly linked list (DLL) is a special type of linked list in which each node contains a pointer to the previous node as well as the next node of the linked list. Reference Image

Stack

Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first, comes out last. Reference Image

Queue

A Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of “First in First out” (FIFO), where the first element added to the queue is the first one to be removed. Queues are commonly used in various algorithms and applications for their simplicity and efficiency in managing data flow. Reference Image

About

Designed to add codes for various data structures and its application

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages