#100

Same Tree

easy· Treesruns: 0

Given the roots of two binary trees p and q, write a function to check if they are the same tree. Two binary trees are the same when they are structurally identical and the nodes have the same value at every position.

wpm 0acc 100%time 0:000 / 333

class Solution:
    def isSameTree(
        self, p: TreeNode | None, q: TreeNode | None
    ) -> bool:
        if not p and not q:
            return True
        if not p or not q or p.val != q.val:
            return False
        return self.isSameTree(p.left, q.left) and self.isSameTree(
            p.right, q.right
        )

click the box to focus · tab inserts 4 spaces · backspace to correct · esc to pause

desktop only

codedrill is a typing game and needs a real keyboard. open this on a laptop or desktop to practice.

you can still browse problems and sections from your phone.