Leetcode - 226. Invert Binary Tree

Leetcode - 226. Invert Binary Tree

• Given the root of a binary tree, invert the tree, and return its root.

Solution

func invertTree(root *TreeNode) *TreeNode {
    if root == nil{
        return root
    }

    tmp := root.Left
    root.Left = root.Right
    root.Right = tmp

    invertTree(root.Left)
    invertTree(root.Right)
    return root
}

Another approach…

func invertTree(root *TreeNode) *TreeNode {
    traverse(root)
    return root
}

func traverse(root *TreeNode){
    if root == nil{
        return
    }

    left := root.Left
    right := root.Right

    root.Left = right
    root.Right = left

    traverse(root.Left)
    traverse(root.Right)
}