Symmetric Tree LC101 Interview Notes

View and share code snippets on Pastefy.

# Symmetric Tree (LeetCode 101): Interview Notes

## Problem
Classic interview warm-up — confirm constraints aloud before coding.

## Approach
Mirror recursion: left.val==right.val and left.left mirrors right.right.

## Complexity
Time O(n), space O(h).

## Practice tip
Walk a dry-run on [the Linkjob AI app](https://www.linkjob.ai/).

*Disclosure: I work on Linkjob AI.*

Tags