How to create a pointer to another pointer in a linked list?
Last Updated :
31 Jan, 2023
In this article we cover how to create a pointer to another pointer in a linked list, it can be singly, doubly, or circularly.
What is Linked List:
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:
Singly Linked List:
- In, a singly linked list, each node has a value and a pointer to the next node.
- It is of most common linked list.
- We can go only in one direction, head to tail.
Doubly Linked List:
- A Doubly Linked List (DLL) contains an extra pointer, typically called the previous pointer, together with the next pointer and data.
- We can go in both directions, head to tail and tail to head.
Circularly Linked List:
- The circular linked list is a linked list where all nodes are connected to form a circle.
- In a circular linked list, the first node and the last node are connected to each other which forms a circle.
- There is no NULL at the end.
How to create a pointer to another pointer in a linked list?
We can create a pointer to another pointer in a linked list by making a dummy node. Let's say you want a pointer that should point to the head of the linked list. Usually, we create a dummy pointer with the value -1.
Below is the implementation:
C++
// C++ program to create a pointer to
// another pointer in a linked list
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
// constructor
Node(int data)
{
this->data = data;
this->next = NULL;
}
// Destructor
~Node()
{
int value = this->data;
if (this->next != NULL) {
delete next;
this->next = NULL;
}
}
};
// Function to insert value at tail of LL
void insertAtTail(Node*& tail, int d)
{
// New node create
Node* temp = new Node(d);
tail->next = temp;
tail = temp;
}
// Function to print the linked list
void print(Node*& head)
{
Node* temp = head;
while (temp != NULL) {
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
// Function to create a dummy pointer
// and point it to head of linked list
Node* createPointer(Node*& head)
{
Node* dummy = new Node(-1);
dummy->next = head;
return dummy;
}
// Driver Code
int main()
{
// Created a new node of
// First singly LL
Node* node = new Node(1);
// Head pointed to node
Node* head = node;
Node* tail = node;
insertAtTail(tail, 2);
insertAtTail(tail, 3);
insertAtTail(tail, 4);
insertAtTail(tail, 5);
cout << "Linked List: " << endl;
print(head);
Node* pt = createPointer(head);
cout
<< "Dummy pointer pointing to head of Linked List: "
<< endl;
print(pt);
return 0;
}
// Java program to create a pointer to
// another pointer in a linked list
import java.io.*;
class Node {
int data;
Node next;
// constructor
public Node(int data)
{
this.data = data;
this.next = null;
}
}
class GFG {
// Function to insert value at tail of LL
static Node insertAtTail(Node tail, int d)
{
// New node create
Node temp = new Node(d);
tail.next = temp;
tail = temp;
return temp;
}
// Function to print the linked list
static void printLL(Node head)
{
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
// Function to create a dummy pointer
// and point it to head of linked list
static Node createPointer(Node head)
{
Node dummy = new Node(-1);
dummy.next = head;
return dummy;
}
public static void main(String[] args)
{
// Created a new node of
// First singly LL
Node node = new Node(1);
// Head pointed to node
Node head = node;
Node tail = node;
tail = insertAtTail(tail, 2);
tail = insertAtTail(tail, 3);
tail = insertAtTail(tail, 4);
tail = insertAtTail(tail, 5);
System.out.println("Linked List: ");
printLL(head);
Node pt = createPointer(head);
System.out.println(
"Dummy pointer pointing to head of Linked List: ");
printLL(pt);
}
}
// This code is contributed by lokesh.
# Python program to create a pointer to
# another pointer in a linked list
class Node:
# constructor
def __init__(self, data):
self.data = data
self.next = None
# Function to insert value at tail of LL
def insertAtTail(tail, d):
# New node create
temp = Node(d)
tail.next = temp
tail = temp
return temp
# Function to print the linked list
def printLL(head):
temp = head
while (temp != None):
print(temp.data,end=" ")
temp = temp.next
print()
# Function to create a dummy pointer
# and point it to head of linked list
def createPointer(head):
dummy = Node(-1)
dummy.next = head
return dummy
# Driver Code
# Created a new node of
# First singly LL
node = Node(1)
# Head pointed to node
head = node
tail = node
tail = insertAtTail(tail, 2)
tail = insertAtTail(tail, 3)
tail = insertAtTail(tail, 4)
tail = insertAtTail(tail, 5)
print("Linked List: ")
printLL(head)
pt = createPointer(head)
print("Dummy pointer pointing to head of Linked List: ")
printLL(pt)
// C# program to create a pointer to
// another pointer in a linked list
using System;
public class Node {
public int data;
public Node next;
// constructor
public Node(int data)
{
this.data = data;
this.next = null;
}
}
public class GFG {
// Function to insert value at tail of LL
static Node insertAtTail(Node tail, int d)
{
// New node create
Node temp = new Node(d);
tail.next = temp;
tail = temp;
return temp;
}
// Function to print the linked list
static void printLL(Node head)
{
Node temp = head;
while (temp != null) {
Console.Write(temp.data + " ");
temp = temp.next;
}
Console.WriteLine();
}
// Function to create a dummy pointer
// and point it to head of linked list
static Node createPointer(Node head)
{
Node dummy = new Node(-1);
dummy.next = head;
return dummy;
}
static public void Main()
{
// Created a new node of
// First singly LL
Node node = new Node(1);
// Head pointed to node
Node head = node;
Node tail = node;
tail = insertAtTail(tail, 2);
tail = insertAtTail(tail, 3);
tail = insertAtTail(tail, 4);
tail = insertAtTail(tail, 5);
Console.WriteLine("Linked List: ");
printLL(head);
Node pt = createPointer(head);
Console.WriteLine(
"Dummy pointer pointing to head of Linked List: ");
printLL(pt);
}
}
// This code is contributed by lokeshmvs21.
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
function insertAtTail(tail, d) {
const temp = new Node(d);
tail.tail.next = temp;
tail.tail = temp;
}
function print(head) {
let temp = head;
while (temp != null) {
process.stdout.write(temp.data + ' ');
temp = temp.next;
}
console.log();
}
function createPointer(head) {
const dummy = new Node(-1);
dummy.next = head;
return dummy;
}
const node = new Node(1);
const head = node;
const tail = { tail: node };
insertAtTail(tail, 2);
insertAtTail(tail, 3);
insertAtTail(tail, 4);
insertAtTail(tail, 5);
console.log("Linked List:");
print(head);
const pt = createPointer(head);
console.log("Dummy pointer pointing to head of Linked List:");
print(pt);
OutputLinked List:
1 2 3 4 5
Dummy pointer pointing to head of Linked List:
-1 1 2 3 4 5
Time Complexity: O(1)
Auxiliary Space: O(1)
If you want to point to any other Node except the head then you have to first traverse to the node in the linked list. Then you can point the dummy pointer to it.
- Time for traversing: O(N)
- Time for creating the dummy node: O(1)
- Time to point it to the given node: O(1)
Similar Reads
Delete a Node in a Singly Linked List with Only a Pointer Given only a pointer to a node to be deleted in a singly linked list. The task is to delete that node from the list. Note: The given pointer does not point to the last node of the linked list.Examples:Input: LinkedList: 1->2->3->4->5, delete_ptr = 2Output: LinkedList: 1->3->4->5
6 min read
Delete a Doubly Linked List node at a given position Given a doubly linked list and a position pos, the task is to delete the node at the given position from the beginning of Doubly Linked List.Input: LinkedList: 1<->2<->3, pos = 2Output: LinkedList: 1<->3Input: LinkedList: 1<->2<->3, pos = 1Output: LinkedList: 2<->
9 min read
How to write C functions that modify head pointer of a Linked List? Consider simple representation (without any dummy node) of Linked List. Functions that operate on such Linked lists can be divided into two categories: 1) Functions that do not modify the head pointer: Examples of such functions include, printing a linked list, updating data members of nodes like ad
4 min read
Two-Pointer Technique in a Linked List The two-pointer technique is a common technique used in linked list problems to solve a variety of problems efficiently. It involves using two pointers that traverse the linked list at different speeds or in different directions. Use Cases of Two-Pointer Technique in a Linked List:1. Finding the Mid
3 min read
How to copy linked list in Python? Linked Lists: Linked Lists are a type of 'Abstract Data Types' in Python. These data structures are linear in nature. Linked Lists are different from Lists as Linked Lists are stored in non-contiguous (non-continuous) memory whereas lists, in contrast, are stored in contiguous (continuous) memory bl
13 min read
Convert Binary Tree to Doubly Linked List by fixing left and right pointers Given a Binary Tree, the task is to convert it to a Doubly Linked List (DLL) in place. The left and right pointers in nodes will be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be the same as the order of the given Binary Tree. The first node of In
10 min read
Insert a Node after a given Node in Linked List Given a linked list, the task is to insert a new node after a given node of the linked list. If the given node is not present in the linked list, print "Node not found".Examples:Input: LinkedList = 2 -> 3 -> 4 -> 5, newData = 1, key = 2Output: LinkedList = 2 -> 1 -> 3 -> 4 -> 5I
11 min read
Insert Node at the End of a Linked List Given a linked list, the task is to insert a new node at the end of the linked list.Examples:Input: LinkedList = 2 -> 3 -> 4 -> 5, NewNode = 1Output: LinkedList = 2 -> 3 -> 4 -> 5 -> 1Input: LinkedList = NULL, NewNode = 1Output: LinkedList = 1Approach:Â Inserting at the end invol
9 min read
Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it? Given a pointer to a node to be deleted, delete the node. Note that we don’t have a pointer to the head node.Examples:Input: list = 10 -> 20 -> 4 -> 30, delNode = 20Output: 10 -> 4 -> 30Explanation: Node with value 20 is deleted.Input: list = 1 -> 2, delNode = 1Output: 2Explanation
7 min read
Convert Singly Linked List to XOR Linked List Prerequisite: XOR Linked List – A Memory Efficient Doubly Linked List | Set 1XOR Linked List – A Memory Efficient Doubly Linked List | Set 2 An XOR linked list is a memory efficient doubly linked list in which the next pointer of every node stores the XOR of previous and next node's address. Given a
9 min read