翻转一棵二叉树
样例
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) {
if(root == NULL) return;
stack<TreeNode*> stk;
stk.push(root);
while(!stk.empty()){
TreeNode *tmp = stk.top();
stk.pop();
swapTree(tmp);
if(tmp->left) stk.push(tmp->left);
if(tmp->right) stk.push(tmp->right);
}
}
void swapTree(TreeNode *&root){
TreeNode *temp=root->left;
root->left = root->right;
root->right = temp;
}
};