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
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read