Why Traversal Forward and Backward in DSA Typescript?

The Big Idea

Discover how moving forward and backward through data can feel as natural as flipping pages in your favorite book!

The Scenario

Imagine you have a long list of your favorite songs written on paper. You want to find a song you heard yesterday. You start from the first song and check each one until you find it. But what if you want to go back to the previous song or skip to the next one easily? Doing this by flipping pages back and forth manually can be confusing and slow.

The Problem

Manually moving forward and backward through a list on paper or in a simple array means you have to remember positions or start over each time. It's easy to lose track, make mistakes, or waste time flipping through the list repeatedly. This slows you down and makes finding or revisiting items frustrating.

The Solution

Traversal forward and backward in data structures like doubly linked lists lets you move step-by-step in both directions easily. You can go to the next item or back to the previous one without starting over. This makes searching, updating, or reviewing items smooth and fast, just like flipping pages in a well-organized book.

Before vs After

✗ Before

let index = 0;
while (index < list.length) {
  if (list[index] === target) break;
  index++;
}
// To go backward, start over or track index manually

✓ After

let current = head;
while (current !== null) {
  if (current.value === target) break;
  current = current.next;
}
// Move backward easily with current.previous

What It Enables

It enables smooth navigation through data in both directions, making complex tasks like undo, redo, or bidirectional search possible and efficient.

Real Life Example

Think of a music player playlist where you can press next to go forward or previous to go backward through songs instantly without restarting the list.

Key Takeaways

Manual forward/backward movement is slow and error-prone.

Traversal forward and backward lets you move stepwise in both directions easily.

This makes data navigation efficient and user-friendly.

Practice

1. What does forward traversal in a linked list mean?

easy

A. Visiting nodes randomly without order

B. Visiting nodes from the tail to the head in order

C. Skipping every other node while traversing

D. Visiting nodes from the head to the tail in order

Solution

1. Step 1: Understand linked list structure

   A linked list has nodes connected from head to tail in one direction.

2. Step 2: Define forward traversal

   Forward traversal means visiting nodes starting at the head and moving to the tail in order.

3. Final Answer:

   Visiting nodes from the head to the tail in order -> Option D

4. Quick Check:

   Forward traversal = head to tail [OK]

Hint: Forward means start at head and go next nodes [OK]

Common Mistakes:

• Confusing forward with backward traversal
• Thinking traversal is random
• Assuming skipping nodes is traversal

2. Which TypeScript syntax correctly traverses an array forward using a for loop?

easy

A. for(let i = arr.length; i >= 0; i--) { console.log(arr[i]); }

B. for(let i = 0; i < arr.length; i++) { console.log(arr[i]); }

C. for(let i = 1; i <= arr.length; i++) { console.log(arr[i]); }

D. for(let i = arr.length - 1; i > 0; i--) { console.log(arr[i]); }

Solution

1. Step 1: Identify forward traversal loop

   Forward traversal starts at index 0 and goes up to length-1.

2. Step 2: Check loop conditions

   for(let i = 0; i < arr.length; i++) { console.log(arr[i]); } loops from 0 to less than arr.length, printing each element correctly.

3. Final Answer:

   for(let i = 0; i < arr.length; i++) { console.log(arr[i]); } -> Option B

4. Quick Check:

   Forward loop index from 0 to length-1 [OK]

Hint: Start index 0, end before length for forward loop [OK]

Common Mistakes:

• Starting index at 1 instead of 0
• Using i <= arr.length causing out-of-bounds
• Looping backward for forward traversal

3. What is the output of this TypeScript code?

const arr = [10, 20, 30];
for(let i = arr.length - 1; i >= 0; i--) {
  console.log(arr[i]);
}

medium

A. 30 20 10

B. 10 20 30

C. 30 20

D. Error: Index out of bounds

Solution

1. Step 1: Understand loop start and end

   The loop starts at index 2 (arr.length - 1) and goes down to 0.

2. Step 2: Trace output values

   It prints arr[2] = 30, arr[1] = 20, arr[0] = 10 in that order.

3. Final Answer:

   30 20 10 -> Option A

4. Quick Check:

   Backward traversal prints 30 20 10 [OK]

Hint: Backward loop starts at length-1 down to 0 [OK]

Common Mistakes:

• Thinking output is forward order
• Missing last element at index 0
• Assuming error due to loop

4. Identify the error in this backward traversal code for a linked list:

let current = head;
while(current !== null) {
  console.log(current.value);
  current = current.prev;
}

medium

A. It should use current.next instead of current.prev

B. No error, code is correct

C. It should start from tail, not head

D. It should check current.next !== null in while condition

Solution

1. Step 1: Understand backward traversal in linked list

   Backward traversal uses prev pointers starting from the tail node.

2. Step 2: Check starting node

   The code starts at head, but to go backward, it must start at tail.

3. Final Answer:

   It should start from tail, not head -> Option C

4. Quick Check:

   Backward traversal starts at tail [OK]

Hint: Backward traversal must start at tail node [OK]

Common Mistakes:

• Starting backward traversal at head
• Using next instead of prev for backward
• Wrong loop condition check

5. Given a doubly linked list, how would you print all values backward starting from the head node?

hard

A. Traverse forward to tail, then traverse backward from tail to head

B. Traverse backward directly from head using prev pointers

C. Use only next pointers starting from head to print backward

D. Reverse the list first, then traverse forward

Solution

1. Step 1: Understand doubly linked list structure

   Each node has next and prev pointers; head has no prev, tail has no next.

2. Step 2: Plan backward print from head

   To print backward from head, first move forward to tail using next pointers.

3. Step 3: Traverse backward from tail

   From tail, use prev pointers to print nodes backward to head.

4. Final Answer:

   Traverse forward to tail, then traverse backward from tail to head -> Option A

5. Quick Check:

   Backward print from head requires forward then backward traversal [OK]

Hint: Go forward to tail, then backward to print [OK]

Common Mistakes:

• Trying to go backward directly from head
• Using next pointers to print backward
• Reversing list unnecessarily