OJ lintcode 翻转二叉树

翻转一棵二叉树

image.png

/**
 * 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){
            TreeNode * temp=root->left;
            root->left=root->right;
            root->right=temp;
            invertBinaryTree(root->right);
            invertBinaryTree(root->left);
        }
        return ;
    }
};