Scribd
Upload
8 views12 pages

Header Linked List

The document provides an overview of header linked lists, which feature a special header node at the beginning containing important information. It discusses the advantages of header linked lists, such as the ability to store additional data and access all nodes, and outlines different types, including grounded and circular header lists. Additionally, it includes traversal methods and applications, particularly in maintaining polynomials in memory.

Uploaded by

Anisha Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views12 pages

Header Linked List

The document provides an overview of header linked lists, which feature a special header node at the beginning containing important information. It discusses the advantages of header linked lists, such as the ability to store additional data and access all nodes, and outlines different types, including grounded and circular header lists. Additionally, it includes traversal methods and applications, particularly in maintaining polynomials in memory.

Uploaded by

Anisha Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Data Structures

Lecture: Header Linked List

By
Arvind Kumar
Asst. Professor

Lovely Professional University, Punjab


Outlines
• Introduction
• Header Linked List
• Advantages of Header Linked List
• Types of Header Linked List
• Review Questions
Header Linked List
 A header linked list which always contains a special
node at the beginning of the list, called the header node
or Head node.
 This Head node contains important information
regarding linked list.

START
Ø

HEADER NODE
Advantages of Header Linked List
• Header linked list contains a special node at the top.

• This header node need not represent the same type of data that
succeeding nodes do.

• It can have data like, number of nodes, any other data...

• Header node can access the data of all the nodes in the linked
list.
Types of Header Linked List
 A Grounded header list is a header list where the last node
contains the null pointer.
 A Circular header list is a header list where the last node
points back to the header node.
 Two- way Header Linked list
 Circular Two- way Header Linked list

Note:
• Unless otherwise stated or implied, header list will always be circular
list.
• Accordingly, in such a case, the header node also acts as a sentinel
indicating the end of the list.
START
Ø

HEADER NODE

Grounded Header List


START

HEADER NODE

Circular Header List


• If Link [START] = NULL,
then, Grounded Header List is Empty.

• If Link [START] = START,


then, Circular Header List is Empty.
Traversing a Circular Header List
1. If Begin Next = Begin then
Print: “ Circular Header Linked list is empty”
Exit
[End If]
2. Set Pointer = Begin Next
3. Repeat step 4 and 5 While Pointer ≠ Begin
4. Process Pointer Info
5. Set Pointer = Pointer Next
[End Loop]
6. Exit
Use of Header Linked List
• Header Linked lists are frequently used for maintaining
Polynomials in memory.
Review Questions
• What is Header Node?

• How a Linked List is different from Header linked list?

• What is Grounded Header list and circular header list?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy