🚀 Add Element at the End of a Linked List (0 Monster Level)

🧱 1. What is a Linked List?

A Linked List is a collection of nodes connected like a chain.

Each node contains:

• value → data
• next → reference (link) to the next node

[value | next] → [value | next] → [value | null]

👉 The last node always points to null.

---

🧠 2. Core Idea (Very Important)

To add a node at the end:

“Start from head → move step by step → find last node → connect new node”

---

🟢 3. Empty List Case (MOST IMPORTANT START)

If the list is empty:

head = null

Add 5:

We create:

newNode = { value: 5, next: null }

Now:

head → 5 → null

✔ First node becomes the head

---

🟡 4. First Insertion Example

Insert: 5

```text id="a5"
head → null

After push(5):



```text
head → 5 → null

✔ Head is updated

---

Insert: 10

Start:

5 → null

---

Step 1: Create node

10 → null

---

Step 2: Traverse from head

current = 5

Check:

5.next === null ❌ stop here

---

Step 3: Attach node

5.next = 10

Result:

5 → 10 → null

---

🔵 5. Second Insertion (DETAILED DRY RUN)

Insert: 20

Start:

5 → 10 → null

---

Step 1: Create node

20 → null

---

Step 2: Start from head

current = 5

---

Step 3: Move step-by-step

First move:

5 → 10 → null
   ↑ current moves

Now:

current = 10

---

Step 4: Check next

10.next === null ✔ STOP

👉 We found last node

---

Step 5: Attach new node

10.next = 20

---

Final result:

5 → 10 → 20 → null

---

💻 6. Final Clean Code

class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

class LinkedList {
  constructor() {
    this.head = null;
  }

  push(value) {
    const newNode = new Node(value);

    // Case 1: empty list
    if (!this.head) {
      this.head = newNode;
      return;
    }

    // Case 2: traverse to last node
    let current = this.head;

    while (current.next) {
      current = current.next;
    }

    // attach new node
    current.next = newNode;
  }
}

---

⚠️ 7. VERY IMPORTANT RULES

✔ Always check this.head (NOT newNode)
✔ Never do current = newNode ❌
✔ Always use current.next = newNode ✅
✔ Use while (current.next) for traversal

---

⏱️ 8. Complexity

• Without tail: O(n) (you travel whole list)
• With tail pointer: O(1) (instant insert)

---

🔥 9. Interview-Level Insight

Linked list insertion at end is not about “adding value”
It is about “changing references”

You are NOT storing memory addresses manually—
JavaScript automatically stores object references.

---

🧠 Final Mental Model

“Walk until null → replace null with new node”

OR

“Find last node → connect next pointer”