---
title: "Discussion on \"Day 16 – Linked List Insertions, Reversal, Midpoint, Merge, Nth Deletion, and Addition\" | Hashnode"
description: "Discussion on \"Day 16 – Linked List Insertions, Reversal, Midpoint, Merge, Nth Deletion, and Addition\". Insert Node at Head\nIntuition: Create a new node, point it to the current head, and update the head.\nNode* insertAtHead(Node* head, int val) {\n    Node* newNode = new Node(val);\n    newNode->next = head;\n    return newNode;\n}\n// TC: O(1)\n// SC: O(1)\n..."
url: "https://hashnode.com/posts/day-16-linked-list-insertions-reversal-midpoint-merge-nth-deletion-and-addition/687e77c9eb5446d01d600df4"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Day 16 – Linked List Insertions, Reversal, Midpoint, Merge, Nth Deletion, and Addition](https://sids-dsa-journal.hashnode.dev/day-16-linked-list-insertions-reversal-midpoint-merge-nth-deletion-and-addition?utm_source=hashnode&utm_medium=feed)

Insert Node at Head Intuition: Create a new node, point it to the current head, and update the head. Node\* insertAtHead(Node\* head, int val) { Node\* newNode = new Node(val); newNode->next = head; return newNode; } // TC: O(1) // SC: O(1) ...

Jul 21, 2025 · 4 min read · sids-dsa-journal.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#cpp](https://hashnode.com/tag/cpp)

## Written by

[Siddharth Gandhi](https://hashnode.com/@SidGandhiCodes)

@SidGandhiCodes

  
[View profile](https://hashnode.com/@SidGandhiCodes)

Learning. Building. Blogging. Repeat.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
