DSA · Theory

Check if a binary tree is subtree of another binary tree

Theory

700/810

Check if a binary tree is subtree of another binary tree

Check if a binary tree is subtree of another binary tree is a DSA idea you prove with folder on disk, not with a slogan.

Check if a binary tree is subtree of another binary tree order: meaning → left < root < right → one limit. Dumping ten features helps nobody.

Without Check if a binary tree is subtree of another binary tree, a file explorer gets messy and folder on disk is hard to trust.

Check if a binary tree is subtree of another binary tree shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Check if a binary tree is subtree of another binary tree trap: unbalanced BST becoming a list. Kabir loses marks for that every viva.

Check if a binary tree is subtree of another binary tree is not a lonely heading. Kabir ties it to folder on disk.

One breath for Check if a binary tree is subtree of another binary tree, then folder on disk, then unbalanced BST becoming a list. Sit down.

Exam tip

Say Check if a binary tree is subtree of another binary tree 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))

Check if a binary tree is subtree of another binary tree — inorder walks left → node → right (sorted order for a BST).

Short notes

DefCheck if a binary tree is subtree of another binary tree — Kabir uses it for folder on disk in a file explorer.
RuleCheck if a binary tree is subtree of another binary tree → left < root < right.
RememberCheck if a binary tree is subtree of another binary tree + Big-O (a file explorer).
UseCheck if a binary tree is subtree of another binary tree in a file explorer (folder on disk).
TrapCheck if a binary tree is subtree of another binary tree — unbalanced BST becoming a list.
ExCheck if a binary tree is 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 subtree of another binary tree

Example

Short notes

Questions

Check if a binary tree is subtree of another binary tree

Example

Short notes

Questions