"Leetcode-Interview algorithm classic-java implementation" "226-invert binary tree (invert two forks)"

"226-invert binary tree (reverse two fork)" "leetcode-Interview algorithm classic-java Implementation" "All topics Directory Index" code Download "Https://github.com/Wang-Jun-Chao" Original Question

Invert a binary tree.

     4   /     2     \   1   3 6   9

To

     4   /     7     \   9   6 3   1

Main Topic

Flips a binary tree.

Thinking of solving problems

For each node, the left and right sub-tree is exchanged, and the same operation is performed on the left and the sub-nodes.

Code Implementation

Tree Node class

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

Algorithm implementation class

publicclass Solution {      publicinvertTree(TreeNode root) {        ifnull) {            invertTreeNode(root);        }        return root;    }    publicvoidinvertTreeNode(TreeNode root) {        ifnull) {            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, release after the new window to view the full picture.

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

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Leetcode-Interview algorithm classic-java implementation" "226-invert binary tree (invert two forks)"