二叉树反转

http://www.tuicool.com/articles/Yz6feau

class TreeNode {

	int val;
	TreeNode left;
	TreeNode right;

	TreeNode(int x) {
		val = x;
	}
}

public class Solution {
	public TreeNode invertTree(TreeNode root) {
		if (root == null) {
			return null;
		}
		root.left = invertTree(root.left);
		root.right = invertTree(root.right);

		TreeNode tmp = root.left;
		root.left = root.right;
		root.right = tmp;
		return root;
	}

}

二叉树练习题

http://www.cnblogs.com/Hennessy-Road/p/6132363.html

转载于:https://my.oschina.net/u/3015461/blog/1036386