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 topic. In plain words you use it for folder on disk in a file explorer. Don’t start with a slogan — start with that picture.

Smallest example: left < root < right. Type it, run it, and say what you see. If you can do that from memory, you know Burn the binary tree starting from the target node (alt).

From the example next to this theory: Burn the binary tree starting from the target node (alt) — inorder walks left → node → right (sorted order for a BST).

Trap — unbalanced BST becoming a list. Fix that before you talk about advanced DSA.

Viva: what is Burn the binary tree starting from the target node (alt)? Then show left < root < right. Then name the trap.

Exam tip

What is Burn the binary tree starting from the target node (alt)? Show this: left < root < right. Trap: 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) — folder on disk in a file explorer.
Ruleleft < root < right
Trapunbalanced BST becoming a list
Usea file explorer

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