"Leetcode-Interview algorithm classic-java Implementation" "226-invert Binary tree (inverted two fork)" __ Code

"226-invert Binary tree (inverted two)" " leetcode-interview algorithm classic-java Implementation" "All topic Directory Index" code Download "Https://github.com/Wang-Jun-Chao" Original title

Invert a binary tree.

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

To

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

The main effect of the topic

Flip a binary tree.
ideas for solving problems

For each node, its left and right subtree are exchanged, and then the left side of the node is manipulated.
Code Implementation

Tree Node class

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

Algorithm implementation class

public class Solution {public
      TreeNode inverttree (TreeNode root) {

        if (root!= null) {
            inverttreenode (root);
        }
        return root;
    }

    public void Inverttreenode (TreeNode root) {

        if (root!= null) {
            TreeNode tmp = root.left;
            Root.left = root.right;
            Root.right = tmp;

            Inverttree (root.left);
            Inverttree (Root.right);}}

Evaluation Results

　　Click on the picture, the mouse does not release, drag a position, released in a new window to view the full picture.

Special Notes Welcome reprint, Reprint please indicate the source "http://blog.csdn.net/derrantcm/article/details/48100759"