leetcode : Invert Binary Tree

旋转二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

第一种方式是使用递归：

public TreeNode invertTree (TreeNode root){
		if(root != null){
			swap(root);
		}
		return root;
	}
private void swap(TreeNode root) {
		TreeNode temp = root.left;
		root.left = root.right;
		root.right = temp;
		
		if(root.left != null)
			swap(root.left);
		if(root.right != null)
			swap(root.right);
		
	}
	

第二种方式是使用队列：

public TreeNode invertTree (TreeNode root){
		LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
		
		if(root != null){
			queue.add(root);
		}
		while( !queue.isEmpty()){
			TreeNode p = queue.poll();
			if(p.left != null){
				queue.add(p.left);
			}
			if(p.right != null)
				queue.add(p.right);
			TreeNode temp = p.left;
			p.left = p.right;
			p.right = temp;
		}
		return root;
	}