Why Traversal Forward and Backward in DSA Javascript?

The Big Idea

What if you could move through your data like flipping pages forward and backward in a book without losing your place?

The Scenario

Imagine you have a long list of your favorite songs written on paper. You want to find a song you like, but you can only look at the list from top to bottom. If you want to go back to a previous song, you have to start over from the top again.

The Problem

Going through the list only one way is slow and frustrating. If you miss a song or want to check a previous one, you waste time starting from the beginning. It's easy to lose your place or make mistakes when you have to remember where you were.

The Solution

Traversal forward and backward lets you move through a list in both directions easily. You can go to the next item or back to the previous one without starting over. This makes searching and checking items faster and less confusing.

Before vs After

✗ Before

let current = head;
while(current !== null) {
  console.log(current.value);
  current = current.next;
}
// To go backward, start over from head

✓ After

let current = head;
while(current !== null) {
  console.log(current.value);
  current = current.next;
}
// To go backward, use current.prev

What It Enables

This lets you explore data smoothly in both directions, making tasks like searching, editing, or reviewing much easier and faster.

Real Life Example

Think of a music player where you can press next to go forward or previous to go back to songs you just heard without restarting the playlist.

Key Takeaways

Manual one-way checking is slow and error-prone.

Forward and backward traversal lets you move easily in both directions.

This makes data handling faster and less confusing.

Practice

1. What does it mean to traverse a linked list forward?

easy

A. Visiting nodes randomly without order

B. Visiting nodes from the first node to the last node in order

C. Skipping every other node while visiting

D. Visiting nodes from the last node to the first node in reverse order

Solution

1. Step 1: Understand forward traversal

   Forward traversal means starting at the first node (head) and moving to the next node repeatedly until the end.

2. Step 2: Compare with other options

   Backward traversal is the opposite, from last to first. Skipping or random visiting is not traversal.

3. Final Answer:

   Visiting nodes from the first node to the last node in order -> Option B

4. Quick Check:

   Forward traversal = first to last [OK]

Hint: Forward means start to end in order [OK]

Common Mistakes:

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

2. Which of the following is the correct syntax to traverse an array arr forward in JavaScript?

easy

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

B. for (let i = arr.length; i >= 0; 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 syntax

   Forward traversal starts at index 0 and goes up to index arr.length - 1, so i from 0 to less than arr.length.

2. Step 2: Check each option

   for (let i = 0; i < arr.length; i++) { console.log(arr[i]); } uses i = 0 to i < arr.length, correct. for (let i = arr.length; i >= 0; i--) { console.log(arr[i]); } and D count backward. for (let i = 1; i <= arr.length; i++) { console.log(arr[i]); } starts at 1 and accesses arr[arr.length], which is undefined.

3. Final Answer:

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

4. Quick Check:

   Forward array loop = i from 0 to length-1 [OK]

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

Common Mistakes:

• Starting loop at 1 instead of 0
• Using <= instead of < in loop condition
• Looping backward for forward traversal

3. What will be the output of the following code?

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

medium

A. 10 20 30

B. undefined undefined undefined

C. 30 20 10

D. SyntaxError

Solution

1. Step 1: Analyze loop indices

   The loop starts at i = arr.length - 1 = 2, then decrements i until 0, so indices 2, 1, 0.

2. Step 2: Print elements in reverse order

   arr[2] = 30, arr[1] = 20, arr[0] = 10, so output is 30 20 10.

3. Final Answer:

   30 20 10 -> Option C

4. Quick Check:

   Backward loop prints elements in reverse [OK]

Hint: Loop backward from length-1 to 0 for reverse output [OK]

Common Mistakes:

• Confusing forward and backward indices
• Expecting output in original order
• Off-by-one errors in loop condition

4. Identify the error in the following backward traversal code for an array nums:

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

medium

A. No error, code is correct

B. Loop should increment i instead of decrement

C. Loop condition should be i <= nums.length

D. Loop should start at nums.length - 1 and decrement i

Solution

1. Step 1: Check loop start and direction

   Array indices go from 0 to nums.length - 1. Starting at nums.length is out of bounds.

2. Step 2: Correct loop start and decrement

   Loop should start at nums.length - 1 and decrement i to 0 to traverse backward correctly.

3. Final Answer:

   Loop should start at nums.length - 1 and decrement i -> Option D

4. Quick Check:

   Backward loop start = length-1, decrement i [OK]

Hint: Start backward loop at length-1, not length [OK]

Common Mistakes:

• Starting loop at length causing undefined access
• Incrementing index in backward loop
• Wrong loop condition allowing infinite loop

5. Given a doubly linked list, which traversal method allows visiting nodes both forward and backward efficiently?

hard

A. Using next pointers for forward and prev pointers for backward traversal

B. Using only next pointers for both directions

C. Using only prev pointers for both directions

D. Traversing randomly without pointers

Solution

1. Step 1: Understand doubly linked list structure

   Doubly linked lists have two pointers per node: next (forward) and prev (backward).

2. Step 2: Use pointers for traversal

   Forward traversal uses next pointers; backward traversal uses prev pointers efficiently.

3. Final Answer:

   Using next pointers for forward and prev pointers for backward traversal -> Option A

4. Quick Check:

   Doubly linked list uses next and prev pointers [OK]

Hint: Doubly linked list has next and prev pointers [OK]

Common Mistakes:

• Assuming single pointer can traverse both ways
• Ignoring prev pointers in backward traversal
• Thinking traversal can be random