leetcode-226. Invert Binary Tree

图片演示

算法代码

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