Problem
Given the root of a binary tree, invert (mirror) the tree and return its root.
References
Difficulty
🟢 Easy
Companies
Amazon, Adobe, Sumo Logic
Notes
Language: Java
Swap left and right children at every node recursively. One line of logic after the recursive calls.
Problem
Given the root of a binary tree, invert (mirror) the tree and return its root.
References
Difficulty
🟢 Easy
Companies
Amazon, Adobe, Sumo Logic
Notes
Language: Java
Swap left and right children at every node recursively. One line of logic after the recursive calls.