Data Structures - Lecture 9 [Stack & Queue using Linked List]

Feb 19, 2015Download as pptx, pdf

5 likes7,428 views

This document discusses implementing stacks and queues using linked lists. For a stack, elements are inserted and removed from the head (start) of the linked list for constant time operations. For a queue, elements are inserted at the head and removed from the tail (end) of the linked list, requiring traversing to the second last node for removal. Implementing stacks and queues with linked lists avoids size limitations of arrays and uses dynamic memory allocation.

Stack & Queue
Using Linked List
INSTRUCTOR : MUHAMMAD HAMMAD WASEEM
EMAIL: m.hammad.wasim@gmail.com

Stack Using Linked List
 We can avoid the size limitation of a stack implemented with an
array by using a linked list to hold the stack elements.
 As with array, however, we need to decide where to insert elements
in the list and where to delete them so that push and pop will run
the fastest.
2

Stack Using Linked List
 For a singly-linked list, insert at start or end takes constant time using
the head and current pointers respectively.
 Removing an element at the start is constant time but removal at
the end required traversing the list to the node one before the last.
 Make sense to place stack elements at the start of the list because
insert and removal are constant time.
3

Stack Using Linked List
 No need for the current pointer; head is enough.
4
top
2
5
7
1
1 7 5 2
head

Stack Operation: List
int pop()
{
int x = head->info;
head = head->link;
return x;
}
5
top
2
5
7
1 7 5 2
head

Stack Operation: List
void push(int x)
{
ListNode *newNode;
newNode = new ListNode;
newNode->info = x;
newNode->link=head;
head = newNode;
}
6
top
2
5
7
9
7 5 2
head
push(9)
9
newNode

Most read

Stack Operation: List
int top()
{
return head->info;
}
int IsEmpty()
{
return ( head == NULL );
}
 All operations take constant time.
7

Stack: Array or List
 Since both implementations support stack
operations in constant time, any reason to choose
one over the other?
 Allocating and de-allocating memory for list nodes
does take more time than pre-allocated array.
 List uses only as much memory as required by the
nodes; array requires allocation ahead of time.
 List pointers (head, next) require extra memory.
 Array has an upper limit; List is limited by dynamic
memory allocation.
8

Queue Using Linked List
 Insert an element at the start and removal at the end but it required
extra overhead of traversing the list to the node one before the last.
9

Queue Using Linked List
 No need for the current pointer; head is enough.
10
rear
2571 1 7 5 2
rear front
front

Queue Operation: enqueue
void enqueue(int x)
{
ListNode *newNode;
newNode = new ListNode;
newNode->info = x;
newNode->link=head;
head = newNode;
}
11

Queue Operation: dequeue
Void dequeue()
{
nodePtr = head;
while (nodePtr->link != NULL)
{
previousNode = nodePtr;
nodePtr = nodePtr->next;
}
previousNode->link = nodePtr->link;
delete nodePtr;
}
12

1) Stacks are linear data structures that follow the LIFO (last-in, first-out) principle. Elements can only be inserted or removed from one end called the top of the stack. 2) The basic stack operations are push, which adds an element to the top of the stack, and pop, which removes an element from the top. 3) Stacks have many applications including evaluating arithmetic expressions by converting them to postfix notation and implementing the backtracking technique in recursive backtracking problems like tower of Hanoi.

Linked listKalaivaniKS1

Linked lists are linear data structures where elements are linked using pointers. The three main types are singly, doubly, and circular linked lists. Linked lists allow dynamic memory allocation and fast insertion/deletion compared to arrays but slower access. A linked list contains nodes, each with a data field and pointer to the next node. Basic operations on linked lists include insertion, deletion, traversal, and search. Doubly linked lists include pointers to both the next and previous nodes.

Ppt on Linked list,stack,queueSrajan Shukla

This document discusses different types of linked lists, including singly linked lists, circular linked lists, and doubly linked lists. It provides examples of circular linked lists and explains that in a circular linked list, the last node contains the address of the first node so that the list can be traversed repeatedly. The document also discusses common linked list operations like insertion and deletion of nodes. Finally, it covers stacks and queues, defining them as LIFO and FIFO data structures, respectively, and providing examples of their implementation and different types.

Isomorphic graphumair khan

The document discusses various graph theory topics including isomorphism, cut sets, labeled graphs, and Hamiltonian circuits. It defines isomorphism as two graphs being structurally identical with a one-to-one correspondence between their vertices and edges. Cut sets are edges whose removal would disconnect a connected graph. Labeled graphs assign labels or weights to their vertices and/or edges. A Hamiltonian circuit is a closed walk that visits each vertex exactly once.

5G Wireless TechnologyNiki Upadhyay

The document discusses the evolution of wireless technologies from 1G to 5G. It describes the key concepts and architecture of 5G, including its hardware, software, and features. 5G is expected to offer speeds up to 1 Gbps, make wireless communication almost limitless, and enable new applications through its high connectivity and capabilities. It concludes that 5G will be more user-centric and available at lower costs than previous generations of wireless technology.

STACKS IN DATASTRUCTUREArchie Jamwal

This document discusses stacks as a linear data structure. It defines a stack as a last-in, first-out (LIFO) collection where the last item added is the first removed. The core stack operations of push and pop are introduced, along with algorithms to insert, delete, and display items in a stack. Examples of stack applications include reversing strings, checking validity of expressions with nested parentheses, and converting infix notation to postfix.

Queue pptSouravKumar328

The document discusses different types of queues, including simple, circular, priority, and double-ended queues. It describes the basic queue operations of enqueue and dequeue, where new elements are added to the rear of the queue and existing elements are removed from the front. Circular queues are more memory efficient than linear queues by connecting the last queue element back to the first, forming a circle. Priority queues remove elements based on priority rather than order of insertion. Double-ended queues allow insertion and removal from both ends. Common applications of queues include CPU and disk scheduling, synchronization between asynchronous processes, and call center phone systems.

StackSeema Sharma

This document discusses stacks and their applications. It defines a stack as a Last In First Out (LIFO) data structure where newly added items are placed on top. The core stack operations of PUSH, POP, and PEEK are described. An array implementation of stacks is presented and animations demonstrate push and pop operations. Applications of stacks like checking for balanced braces, converting infix to postfix notation, and postfix calculators are explained with examples. Pseudocode provides an algorithm for infix to postfix conversion using a stack.

Stack data structureTech_MX

The document discusses implementation of stacks. It describes stacks as linear data structures that follow LIFO principles. Key stack operations like push and pop are outlined. Stacks are often implemented using arrays or linked lists. Examples of stack applications include recursion handling, expression evaluation, parenthesis checking, and backtracking problems. Conversion from infix to postfix notation using a stack is also demonstrated.

Binary tree traversal pptPREEYANKAV

Lec 17 heap data structureSajid Marwat

The document discusses heap data structures and their use in priority queues and heapsort. It defines a heap as a complete binary tree stored in an array. Each node stores a value, with the heap property being that a node's value is greater than or equal to its children's values (for a max heap). Algorithms like Max-Heapify, Build-Max-Heap, Heap-Extract-Max, and Heap-Increase-Key are presented to maintain the heap property during operations. Priority queues use heaps to efficiently retrieve the maximum element, while heapsort sorts an array by building a max heap and repeatedly extracting elements.

Array data structuremaamir farooq

HeapsHafiz Atif Amin

This document provides information about priority queues and binary heaps. It defines a binary heap as a nearly complete binary tree where the root node has the maximum/minimum value. It describes heap operations like insertion, deletion of max/min, and increasing/decreasing keys. The time complexity of these operations is O(log n). Heapsort, which uses a heap data structure, is also covered and has overall time complexity of O(n log n). Binary heaps are often used to implement priority queues and for algorithms like Dijkstra's and Prim's.

Computer Science-Data Structures :Abstract DataType (ADT)St Mary's College,Thrissur,Kerala

The document discusses abstract data types (ADTs) and several common data structures, including stacks, queues, linked lists, trees, and their applications. An ADT defines a data type and operations on that data type without specifying how those operations are implemented. Common programming languages define simple ADTs like integers, while more complex ADTs like lists, stacks and queues must be explicitly defined. The key operations and applications of each data structure are described.

Ppt bubble sortprabhakar jalasutram

The document describes the bubble sort algorithm. It takes an array of numbers as input, such as {1,3,5,2,4,6}, and sorts it in ascending order through multiple passes where adjacent elements are compared and swapped if in the wrong order, resulting in the sorted array {1,2,3,4,5,6}. The algorithm works by making multiple passes through the array, swapping adjacent elements that are out of order on each pass until the array is fully sorted.

Data Structures - Lecture 7 [Linked List]Muhammad Hammad Waseem

- A linked list is a data structure where each node contains a data field and a pointer to the next node. - It allows dynamic size and efficient insertion/deletion compared to arrays. - A doubly linked list adds a pointer to the previous node, allowing traversal in both directions. - A circular linked list connects the last node back to the first node, making it a continuous loop. - Variations require changes to the node structure and functions like append/delete to handle the added previous/next pointers.

Linked ListAshim Lamichhane

a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np

queue & its applicationssomendra kumar

The document discusses different types of queues including their representations, operations, and applications. It describes queues as linear data structures that follow a first-in, first-out principle. Common queue operations are insertion at the rear and deletion at the front. Queues can be represented using arrays or linked lists. Circular queues and priority queues are also described as variants that address limitations of standard queues. Real-world and technical applications of queues include CPU scheduling, cashier lines, and data transfer between processes.

Stack & Queue using Linked List in Data StructureMeghaj Mallick

Doubly Linked ListNinad Mankar

Each node in a doubly linked list contains two pointers - one pointing to the next node and one pointing to the previous node. This allows traversal in both directions through the list. A doubly linked list supports common operations like insertion and deletion at both ends of the list as well as anywhere in the list by updating the relevant pointer fields of the nodes. While requiring more space per node, doubly linked lists allow easy traversal backwards through the list and reversing of the list.

Singly linked listAmar Jukuntla

This document discusses different operations on linked lists such as insertion, deletion, and traversal. It begins with an introduction to linked lists explaining that each node contains a data field and pointer to the next node. It then covers implementing a basic node structure and various functions like creating a new node, adding a node to the beginning or end of the list, and deleting a node from the beginning, end, or a given position. Traversal and keeping track of previous nodes is important for operations like deletion from within the list. The document provides pseudocode to demonstrate common linked list operations.

Doubly Linked ListV.V.Vanniaperumal College for Women

Doubly linked lists allow navigation in both directions by linking each node to both the next and previous nodes. Each node contains data and pointers to the next and previous nodes. Operations like insertion and deletion are more complex than with singly linked lists since both next and previous pointers must be updated. However, elements can be easily accessed from either direction. Basic operations on doubly linked lists include insertion and deletion at the beginning, end, or at a specified position in the list by adjusting the relevant next and previous pointers.

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Sparse matrix and its representation data structureVardhil Patel

The document discusses sparse matrices and their efficient representation. It defines a sparse matrix as one with very few non-zero elements, so representing it as a standard 2D array wastes space storing many zero values. More efficient representations of sparse matrices include storing only the non-zero elements and their indices in a triplet format, or using a linked list structure with one list per row containing (column, value) node pairs. Examples of each approach are provided.

Applications of stackeShikshak

The document discusses applications of stacks, including reversing strings and lists, Polish notation for mathematical expressions, converting between infix, prefix and postfix notations, evaluating postfix and prefix expressions, recursion, and the Tower of Hanoi problem. Recursion involves defining a function in terms of itself, with a stopping condition. Stacks can be used to remove recursion by saving local variables at each step.

Stacksrihariyenduri

Queue Implementation Using Array & Linked ListPTCL

This document describes two implementations of a queue data structure in C++. A queue uses the First In First Out (FIFO) principle to add and remove elements. Elements can be added to the rear of the queue using the Enque operation and removed from the front using the Deque operation. The first implementation uses an array to store queue elements, while the second uses linked nodes to dynamically allocate memory for elements as they are added. Both implementations provide functions for Enqueuing, Dequeuing, checking if the queue is empty, and displaying the queue elements.

linked list in data structure shameen khan

This document discusses data structures and linked lists. It provides definitions and examples of different types of linked lists, including: - Single linked lists, which contain nodes with a data field and a link to the next node. - Circular linked lists, where the last node links back to the first node, forming a loop. - Doubly linked lists, where each node contains links to both the previous and next nodes. - Operations on linked lists such as insertion, deletion, traversal, and searching are also described.

Linked stacks and queuesRamzi Alqrainy

This document discusses different types of linked lists, including singly-linked lists where each node has a link to the next node, doubly-linked lists where each node has links to both the next and previous nodes, and circularly-linked lists where the first and last nodes are linked together. It also describes the basic node structure that makes up a linked list, with a data field and link to another node.

[OOP - Lec 20,21] InheritanceMuhammad Hammad Waseem

Inheritance allows one class to inherit properties from another parent class. This creates a hierarchy where child classes inherit behavior from the parent class and can add or override behavior. There are three types of access specifiers that determine whether inherited members are public, private, or protected. Virtual functions allow runtime polymorphism by overriding functions in derived classes. Pure virtual functions define an interface that derived classes must implement.

More Related Content

What's hot (20)

Stack data structureTech_MX

Binary tree traversal pptPREEYANKAV

Lec 17 heap data structureSajid Marwat

Array data structuremaamir farooq

HeapsHafiz Atif Amin

Computer Science-Data Structures :Abstract DataType (ADT)St Mary's College,Thrissur,Kerala

Ppt bubble sortprabhakar jalasutram

Data Structures - Lecture 7 [Linked List]Muhammad Hammad Waseem

Linked ListAshim Lamichhane

queue & its applicationssomendra kumar

Stack & Queue using Linked List in Data StructureMeghaj Mallick

Doubly Linked ListNinad Mankar

Singly linked listAmar Jukuntla

Doubly Linked ListV.V.Vanniaperumal College for Women

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Sparse matrix and its representation data structureVardhil Patel

Applications of stackeShikshak

Stacksrihariyenduri

Queue Implementation Using Array & Linked ListPTCL

linked list in data structure shameen khan

Stack data structureTech_MX

Binary tree traversal pptPREEYANKAV

Lec 17 heap data structureSajid Marwat

Array data structuremaamir farooq

HeapsHafiz Atif Amin

Computer Science-Data Structures :Abstract DataType (ADT)St Mary's College,Thrissur,Kerala

Ppt bubble sortprabhakar jalasutram

Data Structures - Lecture 7 [Linked List]Muhammad Hammad Waseem

Linked ListAshim Lamichhane

queue & its applicationssomendra kumar

Stack & Queue using Linked List in Data StructureMeghaj Mallick

Doubly Linked ListNinad Mankar

Singly linked listAmar Jukuntla

Doubly Linked ListV.V.Vanniaperumal College for Women

Doubly Linked List || Operations || AlgorithmsShubham Sharma

Sparse matrix and its representation data structureVardhil Patel

Applications of stackeShikshak

Stacksrihariyenduri

Queue Implementation Using Array & Linked ListPTCL

linked list in data structure shameen khan

Viewers also liked (20)

Linked stacks and queuesRamzi Alqrainy

[OOP - Lec 20,21] InheritanceMuhammad Hammad Waseem

[OOP - Lec 01] Introduction to OOPMuhammad Hammad Waseem

This document outlines an object-oriented programming course. The course aims to teach OOP concepts like encapsulation, inheritance and polymorphism using C++. It will cover basic building blocks like classes and objects, access specifiers, constructors, destructors, function overloading and more. Students are expected to have experience in C and knowledge of functions, structures and pointers. The goal is to learn OOP principles, practice coding, and ask questions.

Stacks,queues,linked-listpinakspatel

A stack is a linear data structure that follows the LIFO (last in, first out) principle. Elements are inserted and removed from the top of the stack. Common stack operations include push to add an element and pop to remove the top element. Stacks can be implemented using arrays or linked lists. Stacks are useful for operations like converting infix expressions to postfix and evaluating postfix expressions using a stack to hold operands. Queues follow the FIFO (first in, first out) principle with elements added to the rear and removed from the front. Common queue operations are enqueue to add and dequeue to remove elements. Queues can also be implemented using arrays or linked lists. Linked lists store elements in nodes with each node

Data Structures - Lecture 3 [Arrays]Muhammad Hammad Waseem

This document discusses arrays in C programming. It defines an array as a group of consecutive memory locations that all have the same name and type. Arrays allow storing multiple values of the same type together. Elements in an array are accessed via an index, with the first element having an index of 0. The document covers declaring and initializing arrays, passing arrays to functions, and modifying arrays. It provides an example program that demonstrates printing the values in an array and modifying an array by passing it to a function.

Stack using Linked ListSayantan Sur

[OOP - Lec 19] Static Member FunctionsMuhammad Hammad Waseem

Static member functions can be accessed without creating an object of the class. They are used to access static data members, which are shared by all objects of a class rather than each object having its own copy. The examples show declaring a static data member n and static member function show() that prints n. show() is called through the class name without an object. Each object creation in the constructor increments n, and show() prints the updated count.

Stacks Implementation and Examplesgreatqadirgee4u

Linked listsSARITHA REDDY

This document discusses different types of linked lists including single linked lists, double linked lists, circular linked lists, and circular double linked lists. It describes the basic operations that can be performed on linked lists such as creation, insertion, deletion, traversal, searching, concatenation, and display. It provides examples of how to insert and delete nodes from both single and double linked lists. The document also discusses recursive operations and advantages and disadvantages of using linked lists.

Data structure and its typesNavtar Sidhu Brar

Data structures allow for the organization and storage of data. There are linear and non-linear data structures. Linear structures include arrays, stacks, queues, and linked lists. Arrays store elements in contiguous memory locations. Stacks and queues follow first-in last-out and first-in first-out rules respectively. Linked lists connect nodes using pointers. Non-linear structures include trees and graphs which emulate hierarchical and network-like connections. Common operations on data structures include traversing, searching, insertion, and deletion.

Linked listakshat360

Linked lists are linear data structures where each node contains a data field and a pointer to the next node. There are two types: singly linked lists where each node has a single next pointer, and doubly linked lists where each node has next and previous pointers. Common operations on linked lists include insertion and deletion which have O(1) time complexity for singly linked lists but require changing multiple pointers for doubly linked lists. Linked lists are useful when the number of elements is dynamic as they allow efficient insertions and deletions without shifting elements unlike arrays.

Data structures and algorithmsJulie Iskander

stack presentationShivalik college of engineering

[OOP - Lec 13,14,15] Constructors / Destructor and its TypesMuhammad Hammad Waseem

[OOP - Lec 09,10,11] Class Members & their AccessingMuhammad Hammad Waseem

The document discusses classes in C++. It explains that a class defines a new user-defined data type by encapsulating data members and member functions. It provides examples of defining a Circle class that encapsulates data like radius and member functions to set the radius, get the diameter, area, and circumference. It describes class access specifiers like private and public and how member functions can be defined inside or outside the class.

[OOP - Lec 16,17] Objects as Function Parameter and ReturnTypeMuhammad Hammad Waseem

This document discusses passing objects as parameters and returning objects from member functions in C++. It provides an example class "Travel" that holds kilometers and hours traveled as data members. Member functions get() and show() are used to input and output travel details for individual objects. The add() member function takes another Travel object as a parameter, adds the kilometers and hours, and returns a new Travel object with the total. This demonstrates that objects can be passed as parameters like other variables, and member functions can return objects of the same class type.

Doubly Link ListKashif Memon

A doubly linked list is a linked list where each node contains a link to the next node and the previous node. This allows traversal in both directions. Each node contains data and pointers to the next and previous nodes. The head node's previous pointer points to null and the tail node's next pointer points to null. Methods like addElementFront(), addElementRear(), and deleteElement() are used to add and remove nodes from the list. Compared to a singly linked list, a doubly linked list requires updating more pointers but provides the ability to traverse backwards through the list.

[OOP - Lec 18] Static Data MemberMuhammad Hammad Waseem

The document discusses static data members in C++. It explains that a static data member is shared among all objects of a class and is defined with the static keyword. Only one variable is created in memory even if there are multiple objects. It is visible only within the class and persists for the lifetime of the program. The document provides examples of declaring and defining static data members separately, and using them to assign unique roll numbers to student objects.

Stack, queue and hashingDumindu Pahalawatta

This document provides information about stacks, queues, and hashing. It describes stacks as data structures where the last item inserted is the first item accessed. Common stack operations like push(), pop(), and peek() are discussed. Array and linked list implementations of stacks are presented. Examples of stack applications in compiler design, expression evaluation, and spell checking are given. Queues are defined as structures where the first item inserted is the first item accessed (FIFO). Circular queue implementations are described to avoid overflow issues. Deques, which allow insertion and removal from both ends, are also introduced. Implementation of queues using arrays is demonstrated with methods like enqueue(), dequeue(), and isEmpty().

6.queueChandan Singh

This document discusses different data structures used to implement queues and priority queues. It describes: - Queues as first-in, first-out linear lists that allow insertion at the rear and deletion at the front. - Two common implementations of queues using arrays and linked lists. - Deques, which allow insertion and deletion from both ends. - Priority queues, where elements have priorities and higher priority elements are processed first.

Linked stacks and queuesRamzi Alqrainy

[OOP - Lec 20,21] InheritanceMuhammad Hammad Waseem

[OOP - Lec 01] Introduction to OOPMuhammad Hammad Waseem

Stacks,queues,linked-listpinakspatel

Data Structures - Lecture 3 [Arrays]Muhammad Hammad Waseem

Stack using Linked ListSayantan Sur

[OOP - Lec 19] Static Member FunctionsMuhammad Hammad Waseem

Stacks Implementation and Examplesgreatqadirgee4u

Linked listsSARITHA REDDY

Data structure and its typesNavtar Sidhu Brar

Linked listakshat360

Data structures and algorithmsJulie Iskander

stack presentationShivalik college of engineering

[OOP - Lec 13,14,15] Constructors / Destructor and its TypesMuhammad Hammad Waseem

[OOP - Lec 09,10,11] Class Members & their AccessingMuhammad Hammad Waseem

[OOP - Lec 16,17] Objects as Function Parameter and ReturnTypeMuhammad Hammad Waseem

Doubly Link ListKashif Memon

[OOP - Lec 18] Static Data MemberMuhammad Hammad Waseem

Stack, queue and hashingDumindu Pahalawatta

6.queueChandan Singh

Similar to Data Structures - Lecture 9 [Stack & Queue using Linked List] (20)

DS Unit 2.pptJITTAYASHWANTHREDDY

This document discusses linked lists and representing stacks and queues using linked lists. It provides information on different types of linked lists including singly, doubly, and circular linked lists. It describes inserting, deleting, and traversing nodes in a singly linked list. It also provides a C program example to implement a stack using a linked list with functions for push, pop, and display operations. The document discusses how linked lists are dynamic data structures that can grow and shrink in size as needed, unlike arrays.

Abscddnddmdkwkkstack implementation.pptxzainshahid3040

Data StructureHarshGupta663

This presentation covers data structures including arrays, linked lists, and stacks. It discusses array types (one and multi-dimensional), linked list types (singly, doubly, circular), and common operations for each. Stack operations like push, pop, peek and applications for infix, prefix, postfix notation conversion are also explained with examples. Code snippets are provided for array traversal, insertion, deletion as well as linked list creation, insertion, deletion and traversal.

Stack and Queue Apurbo Datta

Data Structures and Agorithm: DS 06 Stack.pptxRashidFaridChishti

LinkedList1LinkedList1LinkedList1111.pdftimoemin50

computer notes - Stackecomputernotes

- The document discusses implementing a stack data structure using a linked list to overcome the fixed size limitation of an array. - When using a linked list, elements can be inserted at the start or end in constant time, but removing from the start is more efficient than the end. - Therefore, the stack implementation inserts new nodes at the start of the linked list for the push() operation and removes nodes from the start for the pop() operation. - Code examples are provided for the push() and pop() methods to demonstrate how elements are added and removed from the start of the linked list.

UNIT 2LINKEDLISdddddddddddddddddddddddddddT.pptxshesnasuneer

module 3-.pptxkumarkaushal17

This document discusses linked lists and their implementation in C. It defines linked lists as dynamic data structures where each node contains a data field and a pointer to the next node. The document covers representing linked lists in C using self-referential structures, creating and connecting nodes, and various types of linked lists. It also summarizes common linked list operations like traversal, insertion, and deletion at different positions through algorithms and code examples.

linkedlistforslideshare-210123143943.pptxshesnasuneer

Lecture ............ 3 - Linked Lists.pptxSumeetRathi5

Stacks and Queues with Linked List.pdfGKalyani4

Linked list Arbind Mandal

A linked list is a data structure where each node contains a data field and a reference to the next node. The head node points to the first node, and nodes are connected through next references. Linked lists allow for efficient insertions and deletions compared to arrays. Common types include singly linked, doubly linked, circular singly linked, and circular doubly linked lists. Operations on linked lists include insertion, deletion, and searching.

Unit II Data Structure 2hr topic - List - Operations.pptxMani .S (Specialization in Semantic Web)

This document provides information on various operations that can be performed on linked lists, including inserting, deleting, searching, sorting, and reversing nodes. It begins by explaining how to create a basic linked list with three nodes by allocating memory for each node, assigning data values, and connecting the nodes. It then discusses functions for inserting nodes at the beginning, middle, or end of the list. Other operations covered include traversing the list, deleting nodes, searching for a value, sorting nodes, and reversing the order of nodes. Code examples are provided for many of the operations.

Advanced s and s algorithm.pptLegesseSamuel

This document provides an overview of several advanced sorting algorithms: Shell sort, Quick sort, Heap sort, and Merge sort. It describes the key ideas, time complexities, and provides examples of implementing each algorithm to sort sample data sets. Shell sort improves on insertion sort by sorting elements in a two-dimensional array. Quick sort uses a pivot element and partitions elements into left and right subsets. Heap sort uses a heap data structure and sorts by swapping elements. Merge sort divides the list recursively and then merges the sorted halves.

Linked List Representation of a Linked List.pptxAAUsH2

A linked list is a linear data structure that stores a collection of data elements dynamically. Nodes represent those data elements, and links or pointers connect each node. Each node consists of two fields, the information stored in a linked list and a pointer that stores the address of its next node. The last node contains null in its second field because it will point to no node. A linked list can grow and shrink its size, as per the requirement. It does not waste memory space.

Unit ii(dsc++)Durga Devi

This document discusses different types of linked lists including singly linked lists, circular linked lists, and doubly linked lists. It provides details on representing stacks and queues using linked lists. Key advantages of linked lists over arrays are that linked lists can dynamically grow in size as needed, elements can be inserted and deleted without shifting other elements, and there is no memory wastage. Operations like insertion, deletion, traversal, and searching are described for singly linked lists along with sample C code to implement a linked list, stack, and queue.

LINKED LISTSDhrthi Nanda

A singly linked list is a data structure consisting of nodes where each node stores an element and a link to the next node. The document describes algorithms for inserting nodes at the head, tail, and between two nodes of a singly linked list. It also describes doubly linked lists which allow traversing the list in both directions by including a link to the previous node as well as the next node in each node. Linked lists are useful when the number of elements is unknown or varies, and for operations like inserting or removing elements in the middle of the list without shifting other elements.

Lecture 3 List of Data Structures & Algorithmshaseebanjum2611

Linked listFraboni Ec

The document discusses linked lists and their implementation. It begins by listing the objectives, which are to describe linked lists, how they can be implemented using linked structures, and how to implement various operations on linked lists. It then defines linked lists and describes how they can be implemented using either arrays or linked structures. The rest of the document discusses implementing linked lists using linked nodes, representing them in memory, and how to perform common operations like traversing, searching, inserting and deleting elements from the linked list.

DS Unit 2.pptJITTAYASHWANTHREDDY

Abscddnddmdkwkkstack implementation.pptxzainshahid3040

Data StructureHarshGupta663

Stack and Queue Apurbo Datta

Data Structures and Agorithm: DS 06 Stack.pptxRashidFaridChishti

LinkedList1LinkedList1LinkedList1111.pdftimoemin50

computer notes - Stackecomputernotes

UNIT 2LINKEDLISdddddddddddddddddddddddddddT.pptxshesnasuneer

module 3-.pptxkumarkaushal17

linkedlistforslideshare-210123143943.pptxshesnasuneer

Lecture ............ 3 - Linked Lists.pptxSumeetRathi5

Stacks and Queues with Linked List.pdfGKalyani4

Linked list Arbind Mandal

Unit II Data Structure 2hr topic - List - Operations.pptxMani .S (Specialization in Semantic Web)

Advanced s and s algorithm.pptLegesseSamuel

Linked List Representation of a Linked List.pptxAAUsH2

Unit ii(dsc++)Durga Devi

LINKED LISTSDhrthi Nanda

Lecture 3 List of Data Structures & Algorithmshaseebanjum2611

Linked listFraboni Ec

More from Muhammad Hammad Waseem (20)

[ITP - Lecture 17] Strings in C/C++Muhammad Hammad Waseem

This document discusses strings in C programming. It defines strings as arrays of characters that end with a null terminator (\0). It explains how to initialize and print strings. Common string functions like strlen(), strcpy(), strcat(), and strcmp() are described. The document contrasts strings and character pointers, noting strings cannot be reassigned while pointers can. Finally, it lists and briefly explains other standard string library functions.

[ITP - Lecture 16] Structures in C/C++Muhammad Hammad Waseem

[ITP - Lecture 15] Arrays & its TypesMuhammad Hammad Waseem

[ITP - Lecture 14] RecursionMuhammad Hammad Waseem

Recursion is a process where a function calls itself. In C, functions can call themselves recursively. As an example, calculating the factorial of a number recursively is described. Factorial of a number n is defined as n * (n-1) * (n-2) ... * 1. The recursive factorial function calls itself with decreasing arguments until it reaches 1, at which point it returns 1. It then multiplies the returned values together up the call stack to calculate the final factorial value. Visualizing the recursive calls is difficult, but it is drawn out step-by-step in the document as an example for calculating 3!. Though recursion may seem complex, it can often be the most direct way to code certain algorithms

[ITP - Lecture 13] Introduction to PointersMuhammad Hammad Waseem

Pointers allow a variable to hold the memory address of another variable. A pointer variable contains the address of the variable it points to. Pointers can be used to pass arguments to functions by reference instead of by value, allowing the function to modify the original variables. Pointers also allow a function to return multiple values by having the function modify pointer variables passed to it by the calling function. Understanding pointers involves grasping that a pointer variable contains an address rather than a value, and that pointers enable indirect access to the value at a specific memory address.

[ITP - Lecture 12] Functions in C/C++Muhammad Hammad Waseem

Functions allow programmers to structure code into modular, reusable units. A function contains a block of code that is executed when the function is called. Functions take parameters as input and can return a value. The example function "addition" takes two integer parameters, adds them together, and returns the result. The main function calls addition, passing it the values 5 and 3, and stores the returned value 8 in the variable z. Functions help avoid duplicating code and make programs easier to design, understand, and maintain.

[ITP - Lecture 11] Loops in C/C++Muhammad Hammad Waseem

This document discusses different types of loops in programming - for loops, while loops, and do-while loops. It provides examples of each loop type and explains their syntax and usage. The key points are: - For loops allow specifying an initialization, condition, and increment in one line and are best for known iterations. - While loops repeat until a condition is false and are useful when the number of iterations is unknown. - Do-while loops are similar but check the condition after running the block once, guaranteeing it runs at least once. - Loops can be nested, with inner loops running fully each time the outer loop increments.

[ITP - Lecture 10] Switch Statement, Break and Continue Statement in C/C++Muhammad Hammad Waseem

The document discusses the switch, break, and continue statements in C programming. It explains that a switch statement allows a program to evaluate different code blocks based on the result of an expression. It will execute the matched case and any subsequent cases until reaching a break statement. The break statement exits the current block like a loop. The continue statement skips the rest of the current block and continues to the next iteration of the loop.

[ITP - Lecture 09] Conditional Operator in C/C++Muhammad Hammad Waseem

The conditional operators ? and : are sometimes called ternary operators since they take three arguments. They provide a shorthand way to write if-then-else statements in one line. The general form is expression 1 ? expression 2 : expression 3, which will return expression 2 if expression 1 is true, and expression 3 if expression 1 is false. Examples show how conditional operators can be used to assign values based on boolean expressions or character ranges. Nested conditional operators and limitations where only one statement is allowed after ? or : are also discussed.

[ITP - Lecture 08] Decision Control Structures (If Statement)Muhammad Hammad Waseem

The document discusses different types of if statements in C programming. It describes the basic if statement syntax which executes a statement if a condition is true. It also covers the if-else statement which executes one block of code if the condition is true and another block if false. Else-if clauses allow checking multiple conditions. Logical operators like &&, || and ! can be used to combine conditions. Nested if statements allow if-else blocks within other if/else blocks. Examples are provided to demonstrate calculating discounts, employee bonuses, student grades and more using if and if-else statements.

[ITP - Lecture 07] Comments in C/C++Muhammad Hammad Waseem

[ITP - Lecture 06] Operators, Arithmetic Expression and Order of PrecedenceMuhammad Hammad Waseem

The document discusses arithmetic operators and order of precedence in C++. It defines the basic arithmetic operators (+, -, *, /, %) and their usage. It also explains the rules for integer and float conversions during arithmetic operations. Finally, it describes the order of precedence followed in C++, with multiplication and division having higher precedence than addition and subtraction, and operations in parentheses being evaluated first. Examples are provided to demonstrate how expressions are evaluated based on these rules.

[ITP - Lecture 05] DatatypesMuhammad Hammad Waseem

There are three primary data types in C - char, int, and float. Programmers can derive many other data types from these. For integers, C offers short and long types which occupy 2 and 4 bytes respectively and have different value ranges. Integers can also be declared as signed or unsigned, changing whether negative values are allowed. Char values can also be signed or unsigned, affecting their range from -128 to 127 or 0 to 255. Floating point types include float, double, and long double with increasing range and memory usage.

[ITP - Lecture 04] Variables and Constants in C/C++Muhammad Hammad Waseem

[ITP - Lecture 03] Introduction to C/C++Muhammad Hammad Waseem

C++ is an object-oriented programming language that is an enhanced version of C. A C++ program consists of three main parts: preprocessor directives, the main function, and C++ statements. Preprocessor directives provide instructions to the compiler, such as including header files. The main function indicates the beginning of the program and contains the main body of code. C++ statements are the individual lines of code written within the main function and end with semicolons.

[ITP - Lecture 02] Steps to Create Program & Approaches of ProgrammingMuhammad Hammad Waseem

1. To write a C program, the programmer opens an edit window in an IDE to write code. They must then save the file, which the editor assigns a default name by default or the programmer can specify a name and location. 2. The programmer then compiles the code, which converts it into an object file. If there are no errors, it is successfully compiled. Otherwise, errors are reported. 3. The object file is then linked with library files by a linker, which produces an executable file. 4. Finally, the programmer executes the program by running the executable file, which loads it into memory.

[ITP - Lecture 01] Introduction to Programming & Different Programming LanguagesMuhammad Hammad Waseem

This document provides an introduction to programming languages. It defines programming as a sequence of steps to solve a problem and explains why learning to program is important for developing problem solving skills. It then describes the main types of programming languages - low-level languages like machine language and assembly language that are close to hardware, and high-level languages that are more abstract and English-like. It also discusses the concepts of source code, object code, and language translators like assemblers, interpreters, and compilers that convert source code into executable object code.

[OOP - Lec 08] Encapsulation (Information Hiding)Muhammad Hammad Waseem

Encapsulation refers to bundling together data and behaviors into a single unit called a class. The data and behaviors are inseparable. Encapsulation provides information hiding by separating the internal implementation details of an object from its external accessible properties and methods. This prevents unintended interactions and dependencies that could arise if all data was globally accessible. Access specifiers like public, private, and protected determine which data and methods are accessible from inside or outside the class. Encapsulation builds a protective barrier around data to keep it safe from accidental modification or access from outside the class.

[OOP - Lec 07] Access SpecifiersMuhammad Hammad Waseem

The document discusses access specifiers in C++ classes. There are three access specifiers: public, private, and protected. Private restricts access to class members to only within the class, public allows access from anywhere, and protected is used for inheritance but not discussed here. By default, members are private. Public members can be accessed from outside the class, while private members can only be accessed within class functions. Access specifiers control the scope and accessibility of class members.

[OOP - Lec 06] Classes and ObjectsMuhammad Hammad Waseem

The document discusses classes and objects in object-oriented programming. It defines a class as a blueprint that defines the data and functions that objects of that class will have. Objects are instances of a class that reserve memory and can access class data members and methods. The document outlines how to define a class with public and private sections, and how to then define objects as instances of a class that can access class methods.

[ITP - Lecture 17] Strings in C/C++Muhammad Hammad Waseem

[ITP - Lecture 16] Structures in C/C++Muhammad Hammad Waseem

[ITP - Lecture 15] Arrays & its TypesMuhammad Hammad Waseem

[ITP - Lecture 14] RecursionMuhammad Hammad Waseem

[ITP - Lecture 13] Introduction to PointersMuhammad Hammad Waseem

[ITP - Lecture 12] Functions in C/C++Muhammad Hammad Waseem

[ITP - Lecture 11] Loops in C/C++Muhammad Hammad Waseem

[ITP - Lecture 10] Switch Statement, Break and Continue Statement in C/C++Muhammad Hammad Waseem

[ITP - Lecture 09] Conditional Operator in C/C++Muhammad Hammad Waseem

[ITP - Lecture 08] Decision Control Structures (If Statement)Muhammad Hammad Waseem

[ITP - Lecture 07] Comments in C/C++Muhammad Hammad Waseem

[ITP - Lecture 06] Operators, Arithmetic Expression and Order of PrecedenceMuhammad Hammad Waseem

[ITP - Lecture 05] DatatypesMuhammad Hammad Waseem

[ITP - Lecture 04] Variables and Constants in C/C++Muhammad Hammad Waseem

[ITP - Lecture 03] Introduction to C/C++Muhammad Hammad Waseem

[ITP - Lecture 02] Steps to Create Program & Approaches of ProgrammingMuhammad Hammad Waseem

[ITP - Lecture 01] Introduction to Programming & Different Programming LanguagesMuhammad Hammad Waseem

[OOP - Lec 08] Encapsulation (Information Hiding)Muhammad Hammad Waseem

[OOP - Lec 07] Access SpecifiersMuhammad Hammad Waseem

[OOP - Lec 06] Classes and ObjectsMuhammad Hammad Waseem

Recently uploaded (20)

Trends Spotting Strategic foresight for tomorrow’s education systems - Debora...EduSkills OECD

Deborah Nusche, Senior Analyst, OECD presents at the OECD webinar 'Trends Spotting: Strategic foresight for tomorrow’s education systems' on 5 June 2025. You can check out the webinar on the website https://oecdedutoday.com/webinars/ Other speakers included: Deborah Nusche, Senior Analyst, OECD Sophie Howe, Future Governance Adviser at the School of International Futures, first Future Generations Commissioner for Wales (2016-2023) Davina Marie, Interdisciplinary Lead, Queens College London Thomas Jørgensen, Director for Policy Coordination and Foresight at European University Association

SEXUALITY , UNWANTED PREGANCY AND SEXUAL ASSAULT .pptxPoojaSen20

Pests of Rice: Damage, Identification, Life history, and Management.pptxArshad Shaikh

Rice pests can significantly impact crop yield and quality. Major pests include the brown plant hopper (Nilaparvata lugens), which transmits viruses like rice ragged stunt and grassy stunt; the yellow stem borer (Scirpophaga incertulas), whose larvae bore into stems causing deadhearts and whiteheads; and leaf folders (Cnaphalocrocis medinalis), which feed on leaves reducing photosynthetic area. Other pests include rice weevils (Sitophilus oryzae) and gall midges (Orseolia oryzae). Effective management strategies are crucial to minimize losses.

MATERI PPT TOPIK 4 LANDASAN FILOSOFIS PENDIDIKANaditya23173

"Hymenoptera: A Diverse and Fascinating Order".pptxArshad Shaikh

POS Reporting in Odoo 18 - Odoo 18 SlidesCeline George

Fatman Book HD Pdf by aayush songare.pdfAayush Songare

LDMMIA Free Reiki Yoga S9 Grad Level Intuition IILDM & Mia eStudios

Completed Sunday 6/8. For Weekend 6/14 & 15th. (Fathers Day Weekend US.) These workshops are also timeless for future students TY. No admissions needed. A 9th FREE WORKSHOP Reiki - Yoga “Intuition-II, The Chakras” Your Attendance is valued. We hit over 5k views for Spring Workshops and Updates-TY. Thank you for attending our workshops. If you are new, do welcome. Grad Students: I am planning a Reiki-Yoga Master Course (As a package). I’m Fusing both together. This will include the foundation of each practice. Our Free Workshops can be used with any Reiki Yoga training package. Traditional Reiki does host rules and ethics. Its silent and within the JP Culture/Area/Training/Word of Mouth. It allows remote healing but there’s limits As practitioners and masters, we are not allowed to share certain secrets/tools. Some content is designed only for “Masters”. Some yoga are similar like the Kriya Yoga-Church (Vowed Lessons). We will review both Reiki and Yoga (Master tools) in the Course upcoming. S9/This Week’s Focus: * A continuation of Intuition-2 Development. We will review the Chakra System - Our temple. A misguided, misused situation lol. This will also serve Attunement later. Thx for tuning in. Your time investment is valued. I do select topics related to our timeline and community. For those seeking upgrades or Reiki Levels. Stay tuned for our June packages. It’s for self employed/Practitioners/Coaches… Review & Topics: * Reiki Is Japanese Energy Healing used Globally. * Yoga is over 5k years old from India. It hosts many styles, teacher versions, and it’s Mainstream now vs decades ago. * Anything of the Holistic, Wellness Department can be fused together. My origins are Alternative, Complementary Medicine. In short, I call this ND. I am also a metaphysician. I learnt during the 90s New Age Era. I forget we just hit another wavy. It’s GenZ word of Mouth, their New Age Era. WHOA, History Repeats lol. We are fusing together. * So, most of you have experienced your Spiritual Awakening. However; The journey wont be perfect. There will be some roller coaster events. The perks are: We are in a faster Spiritual Zone than the 90s. There’s more support and information available. (See Presentation for all sections, THX AGAIN.)

Nice Dream.pdf /ErinUsher3

How to Create Time Off Request in Odoo 18 Time OffCeline George

EUPHORIA GENERAL QUIZ FINALS | QUIZ CLUB OF PSGCAS | 21 MARCH 2025Quiz Club of PSG College of Arts & Science

THERAPEUTIC COMMUNICATION included definition, characteristics, nurse patient...parmarjuli1412

The document provides an overview of therapeutic communication, emphasizing its importance in nursing to address patient needs and establish effective relationships. THERAPEUTIC COMMUNICATION included some topics like introduction of COMMUNICATION, definition, types, process of communication, definition therapeutic communication, goal, techniques of therapeutic communication, non-therapeutic communication, few ways to improved therapeutic communication, characteristics of therapeutic communication, barrier of THERAPEUTIC RELATIONSHIP, introduction of interpersonal relationship, types of IPR, elements/ dynamics of IPR, introduction of therapeutic nurse patient relationship, definition, purpose, elements/characteristics , and phases of therapeutic communication, definition of Johari window, uses, what actually model represent and its areas, THERAPEUTIC IMPASSES and its management in 5th semester Bsc. nursing and 2nd GNM students

Parenting Teens: Supporting Trust, resilience and independencePooky Knightsmith

For more information about my speaking and training work, visit: https://www.pookyknightsmith.com/speaking/ SESSION OVERVIEW: Parenting Teens: Supporting Trust, Resilience & Independence The teenage years bring new challenges—for teens and for you. In this practical session, we’ll explore how to support your teen through emotional ups and downs, growing independence, and the pressures of school and social life. You’ll gain insights into the teenage brain and why boundary-pushing is part of healthy development, along with tools to keep communication open, build trust, and support emotional resilience. Expect honest ideas, relatable examples, and space to connect with other parents. By the end of this session, you will: • Understand how teenage brain development affects behaviour and emotions • Learn ways to keep communication open and supportive • Explore tools to help your teen manage stress and bounce back from setbacks • Reflect on how to encourage independence while staying connected • Discover simple strategies to support emotional wellbeing • Share experiences and ideas with other parents

Different pricelists for different shops in odoo Point of Sale in Odoo 17Celine George

IDSP(INTEGRATED DISEASE SURVEILLANCE PROGRAMME...SweetytamannaMohapat

Forestry Model Exit Exam_2025_Wollega University, Gimbi Campus.pdfChalaKelbessa

This is Forestry Exit Exam Model for 2025 from Department of Forestry at Wollega University, Gimbi Campus. The exam contains forestry courses such as Dendrology, Forest Seed and Nursery Establishment, Plantation Establishment and Management, Silviculture, Forest Mensuration, Forest Biometry, Agroforestry, Biodiversity Conservation, Forest Business, Forest Fore, Forest Protection, Forest Management, Wood Processing and others that are related to Forestry.

How to Create Quotation Templates Sequence in Odoo 18 SalesCeline George

Gibson "Secrets to Changing Behaviour in Scholarly Communication: A 2025 NISO...National Information Standards Organization (NISO)

MATERI PPT TOPIK 1 LANDASAN FILOSOFIS PENDIDIKANaditya23173

Stewart Butler - OECD - How to design and deliver higher technical education ...EduSkills OECD

Stewart Butler, Labour Market Economist at the OECD presents at the webinar 'How to design and deliver higher technical education to develop in-demand skills' on 3 June 2025. You can check out the webinar recording via our website - https://oecdedutoday.com/webinars/ . You can check out the Higher Technical Education in England report via this link 👉 - https://www.oecd.org/en/publications/higher-technical-education-in-england-united-kingdom_7c00dff7-en.html You can check out the pathways to professions report here 👉 https://www.oecd.org/en/publications/pathways-to-professions_a81152f4-en.html

Trends Spotting Strategic foresight for tomorrow’s education systems - Debora...EduSkills OECD

SEXUALITY , UNWANTED PREGANCY AND SEXUAL ASSAULT .pptxPoojaSen20

Pests of Rice: Damage, Identification, Life history, and Management.pptxArshad Shaikh

MATERI PPT TOPIK 4 LANDASAN FILOSOFIS PENDIDIKANaditya23173

"Hymenoptera: A Diverse and Fascinating Order".pptxArshad Shaikh

POS Reporting in Odoo 18 - Odoo 18 SlidesCeline George

Fatman Book HD Pdf by aayush songare.pdfAayush Songare

LDMMIA Free Reiki Yoga S9 Grad Level Intuition IILDM & Mia eStudios

Nice Dream.pdf /ErinUsher3

How to Create Time Off Request in Odoo 18 Time OffCeline George

EUPHORIA GENERAL QUIZ FINALS | QUIZ CLUB OF PSGCAS | 21 MARCH 2025Quiz Club of PSG College of Arts & Science

THERAPEUTIC COMMUNICATION included definition, characteristics, nurse patient...parmarjuli1412

Parenting Teens: Supporting Trust, resilience and independencePooky Knightsmith

Different pricelists for different shops in odoo Point of Sale in Odoo 17Celine George

IDSP(INTEGRATED DISEASE SURVEILLANCE PROGRAMME...SweetytamannaMohapat

Forestry Model Exit Exam_2025_Wollega University, Gimbi Campus.pdfChalaKelbessa

How to Create Quotation Templates Sequence in Odoo 18 SalesCeline George

Gibson "Secrets to Changing Behaviour in Scholarly Communication: A 2025 NISO...National Information Standards Organization (NISO)

MATERI PPT TOPIK 1 LANDASAN FILOSOFIS PENDIDIKANaditya23173

Stewart Butler - OECD - How to design and deliver higher technical education ...EduSkills OECD

Data Structures - Lecture 9 [Stack & Queue using Linked List]

1. Stack & Queue Using Linked List INSTRUCTOR : MUHAMMAD HAMMAD WASEEM EMAIL: [email protected]

2. Stack Using Linked List  We can avoid the size limitation of a stack implemented with an array by using a linked list to hold the stack elements.  As with array, however, we need to decide where to insert elements in the list and where to delete them so that push and pop will run the fastest. 2

3. Stack Using Linked List  For a singly-linked list, insert at start or end takes constant time using the head and current pointers respectively.  Removing an element at the start is constant time but removal at the end required traversing the list to the node one before the last.  Make sense to place stack elements at the start of the list because insert and removal are constant time. 3

4. Stack Using Linked List  No need for the current pointer; head is enough. 4 top 2 5 7 1 1 7 5 2 head

5. Stack Operation: List int pop() { int x = head->info; head = head->link; return x; } 5 top 2 5 7 1 7 5 2 head

6. Stack Operation: List void push(int x) { ListNode *newNode; newNode = new ListNode; newNode->info = x; newNode->link=head; head = newNode; } 6 top 2 5 7 9 7 5 2 head push(9) 9 newNode

7. Stack Operation: List int top() { return head->info; } int IsEmpty() { return ( head == NULL ); }  All operations take constant time. 7

8. Stack: Array or List  Since both implementations support stack operations in constant time, any reason to choose one over the other?  Allocating and de-allocating memory for list nodes does take more time than pre-allocated array.  List uses only as much memory as required by the nodes; array requires allocation ahead of time.  List pointers (head, next) require extra memory.  Array has an upper limit; List is limited by dynamic memory allocation. 8

9. Queue Using Linked List  Insert an element at the start and removal at the end but it required extra overhead of traversing the list to the node one before the last. 9

10. Queue Using Linked List  No need for the current pointer; head is enough. 10 rear 2571 1 7 5 2 rear front front

11. Queue Operation: enqueue void enqueue(int x) { ListNode *newNode; newNode = new ListNode; newNode->info = x; newNode->link=head; head = newNode; } 11

12. Queue Operation: dequeue Void dequeue() { nodePtr = head; while (nodePtr->link != NULL) { previousNode = nodePtr; nodePtr = nodePtr->next; } previousNode->link = nodePtr->link; delete nodePtr; } 12

Data Structures - Lecture 9 [Stack & Queue using Linked List]

Recommended

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Data Structures - Lecture 9 [Stack & Queue using Linked List] (20)

More from Muhammad Hammad Waseem (20)

Recently uploaded (20)

Data Structures - Lecture 9 [Stack & Queue using Linked List]