README ¶ < Previous Next > 226. Invert Binary Tree (Easy) Given the root of a binary tree, invert the tree, and return its root. Example 1: Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: Input: root = [2,1,3] Output: [2,3,1] Example 3: Input: root = [] Output: [] Constraints: The number of nodes in the tree is in the range [0, 100]. -100 <= Node.val <= 100 Related Topics [Tree] [Depth-First Search] [Breadth-First Search] [Binary Tree] Expand ▾ Collapse ▴ Documentation ¶ Index ¶ type TreeNode Constants ¶ This section is empty. Variables ¶ This section is empty. Functions ¶ This section is empty. Types ¶ type TreeNode ¶ type TreeNode = kit.TreeNode TreeNode - Definition for a binary tree node. Source Files ¶ View all Source files invert_binary_tree.go Click to show internal directories. Click to hide internal directories.