175.翻转二叉树

描述

翻转一棵二叉树

您在真实的面试中是否遇到过这个题？   是

样例

  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){ 
            stack<TreeNode*> m_stack;
            m_stack.push(root);
            while(!m_stack.empty()){
                TreeNode * m_node=m_stack.top();
                m_stack.pop();
                TreeNode * temp=m_node->left;
                m_node->left=m_node->right;
                m_node->right=temp;
                if(m_node->right!=NULL) m_stack.push(m_node->right);
                if(m_node->left!=NULL) m_stack.push(m_node->left);
            }
        }
    }
};