Leetcode226翻转二叉树

• Leetcode226翻转二叉树

用swap函数进行左右节点的翻转

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(nullptr==root)
            return root;
        else
        {
            swap(root->left,root->right);	//翻转左右节点
            root->left=invertTree(root->left);
            root->right=invertTree(root->right);
            return root;
        }
        
    }
};

执行结果如下