Given roots of two binary trees, check if they are structurally identical and have the same node values. Example: Trees and are the same.
Trees and are not. Same values but different structure. This extends the recursive pattern: instead of computing a value, you're computing a boolean.
Both subtrees must match for the trees to be equal. Constraints: up to nodes per tree, values from to .