DSA · Theory

Flatten Binary Tree to Linked List

Theory

316/810

Flatten Binary Tree to Linked List

Flatten Binary Tree to 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 Flatten Binary Tree to Linked List.

From the example next to this theory: Flatten Binary Tree to 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 Flatten Binary Tree to Linked List? Then show head → next → …. Then name the trap.

Diagram

  [10] → [20] → [30] → /
   head              tail

Exam tip

What is Flatten Binary Tree to Linked List? Show this: head → next → …. Trap: losing the next pointer on delete.

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

Flatten Binary Tree to Linked List — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefFlatten Binary Tree to Linked List — a ticket queue node in a counter.
Rulehead → next → …
Traplosing the next pointer on delete
Usea counter

DSA · Theory

Flatten Binary Tree to Linked List

← All stacks

Theory

316/810

Flatten Binary Tree to Linked List

Flatten Binary Tree to 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 Flatten Binary Tree to Linked List.

From the example next to this theory: Flatten Binary Tree to 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 Flatten Binary Tree to Linked List? Then show head → next → …. Then name the trap.

Diagram

  [10] → [20] → [30] → /
   head              tail

Exam tip

What is Flatten Binary Tree to Linked List? Show this: head → next → …. Trap: losing the next pointer on delete.

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

Flatten Binary Tree to Linked List — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefFlatten Binary Tree to Linked List — a ticket queue node in a counter.
Rulehead → next → …
Traplosing the next pointer on delete
Usea counter

Flatten Binary Tree to Linked List

Example

Short notes

Questions

Flatten Binary Tree to Linked List

Example

Short notes

Questions