Problem: Same Tree Task: You are given the roots of two binary trees p and q. Return true if the trees are identical (same structure and same values at each node), false otherwise. This problem introduces simultaneous tree traversal.
You walk through both trees at the same time, comparing values at each step. If you find any mismatch in structure or value, you return false immediately. The base case: if both nodes are null, they match. If one is null and the other is not, they differ.