lintcode175. 翻转二叉树

翻转一棵二叉树。左右子树交换。

样例
样例 1:

输入: {1,3,#}
输出: {1,#,3}
解释:
	  1    1
	 /  =>  \
	3        3
样例 2:

输入: {1,2,3,#,#,4}
输出: {1,3,2,#,4}
解释: 
	
      1         1
     / \       / \
    2   3  => 3   2
       /       \
      4         4
挑战
递归固然可行，能否写个非递归的？

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {//递归方法
public:
    /**
     * @param root: a TreeNode, the root of the binary tree
     * @return: nothing
     */
    void invertBinaryTree(TreeNode * root) {
        // write your code here
        if(root==NULL)return;
        TreeNode *tmp=root->left;
        root->left=root->right;
        root->right=tmp;
        invertBinaryTree(root->left);
        invertBinaryTree(root->right);
    }
};

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {//非递归方法
public:
    /**
     * @param root: a TreeNode, the root of the binary tree
     * @return: nothing
     */
    void invertBinaryTree(TreeNode * root) {
        // write your code here
        if(root==NULL)return;
        stack<TreeNode*>tmp;
        tmp.push(root);
        while(!tmp.empty())
        {
            TreeNode*t=tmp.top();
            tmp.pop();
            TreeNode *temp=t->left;
            t->left=t->right;
            t->right=temp;
            if(t->left!=NULL)tmp.push(t->left);
            if(t->right!=NULL)tmp.push(t->right);
        }
    }
};