Trees & SearchD1Phase 2treerecursiontransformation

Invert Binary Tree

Mirror a binary tree by swapping each node's left and right children.

Easy Explanation

Invert Binary Tree mirrors a tree by swapping the left and right child at every node.

Visualizer

O(1)Invert Binary Tree

Deterministic tree mirroring playback with per-node visit and child-swap events.

Traversal

n/a

Visited

Swaps

Result

Inverting

Ready

Press Play or Step to start execution.

Original

empty

Current Frame

empty

Final Output

empty

Tree is empty. Use values or randomize to generate a run.

currentswappedvisited

Parameters

Placeholder

Parameter schema and validation are enabled for Binary Search, BFS, Bidirectional BFS, DFS, Dijkstra, A*, Bubble Sort, Quick Sort, Heap Sort, Topological Sort, Union-Find, Kruskal MST, Prim MST, Bellman-Ford, BST Operations, AVL Rotations, Selection Sort, Counting Sort, Insertion Sort, Merge Sort, Invert Binary Tree, and Trie Operations in this milestone.

Other algorithms keep scaffolded controls until their engines are implemented.

Complexity

Param Aware

Time and space complexity with current-run context derived from normalized params and input size.

Best Time

O(1)

Average Time

O(n)

Worst Time

O(n)

Space

O(h)

Current Run

O(1) on this tree

Nodes = 0

Traversal mode = DFS

Auxiliary traversal space profile: O(h)

Observed visited nodes: pending

Empty tree: pending

Complexity updates when params regenerate the deterministic run.

Invert Binary Tree Implementation

Pseudocode + TypeScript

Reference implementation examples are intentionally abstracted from the playback engine so learners can map concepts to code.

pseudocode

function invertTree(node):
  if node is null:
    return null

  swap node.left and node.right

  invertTree(node.left)
  invertTree(node.right)

  return node

1.00xNo Run