Leetcode - Invert Binary Tree

https://leetcode.com/problems/invert-binary-tree/

Invert a binary tree.

Example:

Input:

     4
   /   \
  2     7
 / \   / \
1   3 6   9

Output:

     4
   /   \
  7     2
 / \   / \
9   6 3   1

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func invertTree(root *TreeNode) *TreeNode {
    invert(root)
    return root
}

func invert(node *TreeNode) {
    if node == nil {
        return 
    }
    node.Left, node.Right = node.Right, node.Left
    invert(node.Left)
    invert(node.Right)
}

• 相关文章
• 全局相关文章