Triply Linked list — DSA Technical Interview Questions & Answers

Triply Linked list

Triply Linked list

  • Triply Linked list is a DSA topic. In plain words you use it for a ticket queue node in a counter. Don’t start with a slogan — start with that picture.
  • Smallest example: head → next → …. Type it, run it, and say what you see. If you can do that from memory, you know Triply Linked list.
  • From the example next to this theory: Triply Linked list — a linked list chains nodes with next pointers instead of contiguous indexes.
  • Trap: losing the next pointer on delete. Fix that before you talk about advanced DSA.
  • Viva: what is Triply Linked list? Then show head → next → …. Then name the trap.

Technical Interview Tip: What is Triply Linked list? Show this: head → next → …. Trap: losing the next pointer on delete.

Code Examples for Triply Linked list

Triply Linked list — working example

class Node:
    def __init__(self, val, next=None):
        self.val = val
        self.next = next

head = Node(1, Node(2, Node(3)))
cur = head
while cur:
    print(cur.val, end=" -> " if cur.next else "\n")
    cur = cur.next

Triply Linked list — a linked list chains nodes with next pointers instead of contiguous indexes.

How to Explain Triply Linked list to an Interviewer

What is Triply Linked list?

Used for a ticket queue node a counter Not just the heading

Give one small example of Triply Linked list.

head → next → … Triply Linked list — a linked list chains nodes with next pointers instead of contiguous indexes

What mistake do beginners make with Triply Linked list?

losing the next pointer on delete Show the fix

Where do you use Triply Linked list?

a counter a ticket queue node