Invert Binary Tree — Easy Coding Interview Question

Invert a binary tree by swapping the left and right children of every node.

Example

Input: root = [4,2,7,1,3,6,9]

Output: [4,7,2,9,6,3,1]

Constraints

• 0 ≤ tree nodes ≤ 100

Topics & Companies

Topics: trees, recursion

Asked by: Amazon, Google, Meta, Microsoft, Apple

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(h).

Practice more

• All DSA Problems
• DSA Patterns