invertbinarytree

  * @Title: invertBinaryTree2 
  * @Description: 翻转二叉树的非递归解法，用栈来模拟
  * @param root  
  * @return void  
  * @throws
 */
public static void (TreeNode root) {
	if (root == null) {
		return;
	}
	Stack<TreeNode> stack = new Stack<>();
	stack.push(root);
	while (!stack.empty()) {
		TreeNode current = stack.pop();
		TreeNode temp = current.left;
		current.left = current.right;
		current.right = temp;
		if(current.left != null){
			stack.push(current.left);
		}
		if(current.right != null){
			stack.push(current.right);
		}
	}
}