首页 > itarticle > [leetcode] problem 226 – invert binary tree

[leetcode] problem 226 – invert binary tree

admin 11月 13, 2020 0

Invert a binary tree.

Example

Input:

     4
   /   
  2     7
 /    / 
1   3 6   9

Output:

     4
   /   
  7     2
 /    / 
9   6 3   1

Code

public class  {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

public TreeNode invertTree(TreeNode root) {
    if (root == null)
        return null;

    TreeNode temp = invertTree(root.right);
    root.right = invertTree(root.left);
    root.left = temp;

    return root;
}