DSA · Theory

Check if a Binary Tree is a Subtree of Another Binary Tree

Theory

498/810

Check if a Binary Tree is a Subtree of Another Binary Tree

Amit only reaches for Check if a Binary Tree is a Subtree of Another Binary Tree when folder on disk has to stay correct in a file explorer.

Keep Check if a Binary Tree is a Subtree of Another Binary Tree small. Amit should finish folder on disk in a few lines, not a 40-line dump.

Check if a Binary Tree is a Subtree of Another Binary Tree exists so Amit can keep folder on disk correct in a file explorer.

Use Check if a Binary Tree is a Subtree of Another Binary Tree when folder on disk must stay clear. If a simpler DSA step works, use that instead.

Check if a Binary Tree is a Subtree of Another Binary Tree trap: unbalanced BST becoming a list. Amit loses marks for that every viva.

Place Check if a Binary Tree is a Subtree of Another Binary Tree next to nearby DSA work — left < root < right is the link.

Viva for Check if a Binary Tree is a Subtree of Another Binary Tree: what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Exam tip

For Check if a Binary Tree is a Subtree of Another Binary Tree: definition + a file explorer + one failure.

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))

Check if a Binary Tree is a Subtree of Another Binary Tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefCheck if a Binary Tree is a Subtree of Another Binary Tree — Amit uses it for folder on disk in a file explorer.
RuleCheck if a Binary Tree is a Subtree of Another Binary Tree → left < root < right.
RememberCheck if a Binary Tree is a Subtree of Another Binary Tree + time vs memory (a file explorer).
UseCheck if a Binary Tree is a Subtree of Another Binary Tree in a file explorer (folder on disk).
TrapCheck if a Binary Tree is a Subtree of Another Binary Tree — unbalanced BST becoming a list.
ExCheck if a Binary Tree is a Subtree of Another Binary Tree → 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))

Check if a Binary Tree is a Subtree of Another Binary Tree

Example

Short notes

Questions

Check if a Binary Tree is a Subtree of Another Binary Tree

Example

Short notes

Questions