Doubly Linked List Structure and Node Design in DSA Typescript - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to declare a class for a doubly linked list node with a value property.

DSA Typescript

class Node {
  value: number;
  next: Node | null;
  prev: Node | null;

  constructor(value: number) {
    this.value = [1];
    this.next = null;
    this.prev = null;
  }
}

Drag options to blanks, or click blank then click option'

Aval

Bvalue

Cnode

Ddata

Attempts:

3 left

💡 Hint

Common Mistakes

Using a different variable name that is not defined in the constructor.

Forgetting to assign the value property.

The constructor parameter is named 'value', so we assign 'this.value = value;' to store it in the node.

2fill in blank

medium

Complete the code to initialize the head of the doubly linked list to null.

DSA Typescript

class DoublyLinkedList {
  head: Node | null;
  tail: Node | null;

  constructor() {
    this.head = [1];
    this.tail = null;
  }
}

Drag options to blanks, or click blank then click option'

Aundefined

B0

Cnull

Dthis

Attempts:

3 left

💡 Hint

Common Mistakes

Setting head to undefined or 0 instead of null.

Assigning head to this, which is incorrect.

The head should start as null to indicate the list is empty.

3fill in blank

hard

Fix the error in the method that adds a new node at the end of the doubly linked list.

DSA Typescript

addToEnd(value: number): void {
  const newNode = new Node(value);
  if (this.tail === null) {
    this.head = newNode;
    this.tail = newNode;
  } else {
    this.tail.next = newNode;
    newNode.prev = [1];
    this.tail = newNode;
  }
}

Drag options to blanks, or click blank then click option'

Athis.head

Bnull

CnewNode

Dthis.tail

Attempts:

3 left

💡 Hint

Common Mistakes

Setting newNode.prev to this.head or newNode itself.

Setting newNode.prev to null which breaks the link.

The new node's prev pointer should point to the current tail before updating tail to newNode.

4fill in blank

hard

Fill both blanks to correctly remove the head node from the doubly linked list.

DSA Typescript

removeHead(): number | null {
  if (this.head === null) return null;
  const value = this.head.value;
  this.head = this.head.[1];
  if (this.head !== null) {
    this.head.[2] = null;
  } else {
    this.tail = null;
  }
  return value;
}

Drag options to blanks, or click blank then click option'

Anext

Bprev

CnextNode

Dprevious

Attempts:

3 left

💡 Hint

Common Mistakes

Using incorrect property names like nextNode or previous.

Not setting the new head's prev to null.

To remove the head, move head to head.next and set new head's prev to null.

5fill in blank

hard

Fill all three blanks to insert a new node after a given node in the doubly linked list.

DSA Typescript

insertAfter(node: Node, value: number): void {
  const newNode = new Node(value);
  newNode.prev = node;
  newNode.next = node.[1];
  if (node.[2] !== null) {
    node.[3].prev = newNode;
  }
  node.next = newNode;
}

Drag options to blanks, or click blank then click option'

Anext

Bprev

Attempts:

3 left

💡 Hint

Common Mistakes

Using prev instead of next for forward links.

Not updating the next node's prev pointer.

The new node's next is node.next; if node.next exists, its prev is updated to newNode; finally, node.next is set to newNode.

Practice

1. What is the main difference between a doubly linked list node and a singly linked list node?

easy

A. A doubly linked list node has pointers to both the previous and next nodes.

B. A doubly linked list node stores data in a different format.

C. A doubly linked list node can only point to the next node.

D. A doubly linked list node does not store any data.

Solution

1. Step 1: Understand node pointers in singly linked list

   A singly linked list node has only one pointer to the next node.

2. Step 2: Understand node pointers in doubly linked list

   A doubly linked list node has two pointers: one to the previous node and one to the next node.

3. Final Answer:

   A doubly linked list node has pointers to both the previous and next nodes. -> Option A

4. Quick Check:

   Doubly linked list nodes have two pointers [OK]

Hint: Remember: doubly linked means two directions [OK]

Common Mistakes:

• Thinking doubly linked nodes only point forward
• Confusing data storage with pointer structure
• Assuming doubly linked nodes do not store data

2. Which of the following is the correct TypeScript syntax to define a doubly linked list node class with data of type number?

easy

A. class Node { data: number; next: Node | null; prev: Node | null; constructor(data: number) { this.data = data; this.next = null; this.prev = null; } }

B. class Node { data: number; next: Node; prev: Node; constructor(data: number) { this.data = data; this.next = null; this.prev = null; } }

C. class Node { data: number; next: Node; prev: Node; constructor(data: number) { this.data = data; } }

D. class Node { data: number; next: null; prev: null; constructor(data: number) { this.data = data; this.next = null; this.prev = null; } }

Solution

1. Step 1: Check property types for next and prev

   Since next and prev can be null initially, their types must allow null (Node | null).

2. Step 2: Verify constructor initializes all properties

   The constructor sets data and initializes next and prev to null correctly.

3. Final Answer:

   class Node { data: number; next: Node | null; prev: Node | null; constructor(data: number) { this.data = data; this.next = null; this.prev = null; } } -> Option A

4. Quick Check:

   Allow null for next and prev in TypeScript [OK]

Hint: Use 'Node | null' for nullable pointers [OK]

Common Mistakes:

• Not allowing next and prev to be null
• Forgetting to initialize next and prev in constructor
• Setting next and prev types incorrectly

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

class Node {
  data: number;
  next: Node | null;
  prev: Node | null;
  constructor(data: number) {
    this.data = data;
    this.next = null;
    this.prev = null;
  }
}

const node1 = new Node(10);
const node2 = new Node(20);
node1.next = node2;
node2.prev = node1;

console.log(node1.next?.data);
console.log(node2.prev?.data);

medium

A. Error at runtime

B. 10\n20

C. undefined\nundefined

D. 20\n10

Solution

1. Step 1: Trace node1.next and node2.prev assignments

   node1.next points to node2, so node1.next.data is 20. node2.prev points to node1, so node2.prev.data is 10.

2. Step 2: Check console.log outputs

   console.log(node1.next?.data) prints 20, console.log(node2.prev?.data) prints 10.

3. Final Answer:

   20 10 -> Option D

4. Quick Check:

   next and prev pointers give 20 and 10 respectively [OK]

Hint: Follow next and prev pointers to get data [OK]

Common Mistakes:

• Confusing which node data is printed
• Ignoring optional chaining and assuming errors
• Mixing up prev and next pointers

4. Identify the error in the following TypeScript code for a doubly linked list node and select the fix.

class Node {
  data: number;
  next: Node;
  prev: Node;
  constructor(data: number) {
    this.data = data;
    this.next = null;
    this.prev = null;
  }
}

medium

A. Change data type from number to any.

B. Remove the constructor to fix the error.

C. Change next and prev types to 'Node | null' to allow null assignment.

D. Initialize next and prev with new Node() instead of null.

Solution

1. Step 1: Analyze type declarations and assignments

   next and prev are typed as Node but assigned null, which is invalid in TypeScript.

2. Step 2: Fix type to allow null

   Changing next and prev types to 'Node | null' allows null assignment and fixes the error.

3. Final Answer:

   Change next and prev types to 'Node | null' to allow null assignment. -> Option C

4. Quick Check:

   Nullable pointers need 'Node | null' type [OK]

Hint: Allow null in pointer types to avoid errors [OK]

Common Mistakes:

• Leaving next and prev as non-nullable types
• Trying to assign new Node() without data
• Removing constructor unnecessarily

5. You want to insert a new node with data 30 between two existing nodes in a doubly linked list: nodeA and nodeB, where nodeA.next = nodeB and nodeB.prev = nodeA. Which sequence of pointer updates correctly inserts the new node?

hard

A. nodeA.next = newNode; nodeB.prev = newNode; newNode.next = nodeB; newNode.prev = nodeA;

B. newNode.prev = nodeA; newNode.next = nodeB; nodeA.next = newNode; nodeB.prev = newNode;

C. newNode.next = nodeA; newNode.prev = nodeB; nodeA.prev = newNode; nodeB.next = newNode;

D. nodeA.prev = newNode; nodeB.next = newNode; newNode.prev = nodeB; newNode.next = nodeA;

Solution

1. Step 1: Set newNode pointers to link between nodeA and nodeB

   newNode.prev must point to nodeA and newNode.next must point to nodeB to fit between them.

2. Step 2: Update nodeA and nodeB pointers to include newNode

   nodeA.next should point to newNode and nodeB.prev should point to newNode to complete the insertion.

3. Final Answer:

   newNode.prev = nodeA; newNode.next = nodeB; nodeA.next = newNode; nodeB.prev = newNode; -> Option B

4. Quick Check:

   Link newNode between nodeA and nodeB correctly [OK]

Hint: Link newNode pointers first, then update neighbors [OK]

Common Mistakes:

• Mixing up prev and next pointers
• Updating neighbors before setting newNode pointers
• Reversing nodeA and nodeB in assignments