Depth-First Search pattern
Invert Binary Tree
Given the root of a binary tree, invert it (mirror it left-to-right) and return the root. The interview classic that, per legend, once tripped up a well-known whiteboard candidate. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 226
- Easy
- 1 approach
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Depth-First SearchLeetCode 226
Easy
The approach
- 01 Recursive DFS (swap children) O(n)O(h) space
What you will learn
- How to read Invert Binary Tree and spot the depth-first search pattern in it
- Recursive DFS (swap children): O(n) time, O(h) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Depth-First Search
See Invert Binary Tree run, step by step
Sign in and this page opens on the animation, with all 18 Depth-First Search problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.