DSA · Theory

Burn the binary tree starting from the target node

Theory

681/810

Burn the binary tree starting from the target node

Burn the binary tree starting from the target node (alt) is a DSA idea you prove with folder on disk, not with a slogan.

For Burn the binary tree starting from the target node (alt), a dry-run table is in play. Don’t blame it until you have traced folder on disk.

Skip Burn the binary tree starting from the target node (alt) and unbalanced BST becoming a list shows up in a file explorer.

Dev ships Burn the binary tree starting from the target node (alt) in a file explorer. That is the use case worth saying.

Don’t do this with Burn the binary tree starting from the target node (alt): unbalanced BST becoming a list. Interviewers spot it in ten seconds.

Place Burn the binary tree starting from the target node (alt) next to nearby DSA work — left < root < right is the link.

Viva for Burn the binary tree starting from the target node (alt): what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

Say Burn the binary tree starting from the target node (alt) in one breath, then left < root < right, then unbalanced BST becoming a list.

Example

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

def inorder(n):
    if not n:
        return []
    return inorder(n.left) + [n.val] + inorder(n.right)

root = Node(2, Node(1), Node(3))
print(inorder(root))

Burn the binary tree starting from the target node (alt) — inorder walks left → node → right (sorted order for a BST).

Short notes

DefBurn the binary tree starting from the target node (alt) — Dev uses it for folder on disk in a file explorer.
RuleBurn the binary tree starting from the target node (alt) → left < root < right.
RememberBurn the binary tree starting from the target node (alt) + a dry-run table (a file explorer).
UseBurn the binary tree starting from the target node (alt) in a file explorer (folder on disk).
TrapBurn the binary tree starting from the target node (alt) — unbalanced BST becoming a list.
ExBurn the binary tree starting from the target node (alt) → folder on disk.

class Node: def __init__(self, val, left=None, right=None): self.val, self.left, self.right = val, left, right def inorder(n): if not n: return [] return inorder(n.left) + [n.val] + inorder(n.right) root = Node(2, Node(1), Node(3)) print(inorder(root))

Burn the binary tree starting from the target node

Example

Short notes

Questions

Burn the binary tree starting from the target node

Example

Short notes

Questions