DSA · Theory

Burn the binary tree starting from the target node

Theory

606/810

Burn the binary tree starting from the target node

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

Burn the binary tree starting from the target node on the board: left < root < right. Then say what folder on disk looks like after.

Without Burn the binary tree starting from the target node, a file explorer gets messy and folder on disk is hard to trust.

Use Burn the binary tree starting from the target node when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Burn the binary tree starting from the target node miss: unbalanced BST becoming a list. Fix it before you talk about advanced DSA.

After Burn the binary tree starting from the target node, Arun should still remember unbalanced BST becoming a list.

Viva for Burn the binary tree starting from the target node: 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 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 — inorder walks left → node → right (sorted order for a BST).

Short notes

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