LeetCode_invert binary tree

最新推荐文章于 2021-06-08 01:54:01 发布

wulinsam

最新推荐文章于 2021-06-08 01:54:01 发布

阅读量320

点赞数

本文链接：https://blog.csdn.net/Lyn12030706/article/details/48199613

版权

原题链接：https://leetcode.com/problems/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) {
        invert(root);
        return root;
    }
    void invert(TreeNode* root)
    {         
       if(!root)
          return;
       invert(root->left);
       invert(root->right);
       swap(root->left,root->right);
   }
};