Inverting a binary tree (also known as mirroring a binary tree) involves swapping the left and right children of all nodes in the tree. Here's a simple Python implementation for inverting a binary tree using a recursive approach, as well as an iterative approach using breadth-first traversal.
### Definition of the TreeNode class
First, you need a `TreeNode` class to represent each node in the tree:
```python
class TreeNode:
def


