226. Invert Binary Tree

Invert a binary tree.

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

/**
 * 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:
    void revert(TreeNode* node){
        if(NULL != node){
            TreeNode *t = node->left;
            node->left = node->right;
            node->right = t;
            revert(node->left);
            revert(node->right);
        }
    }
    
    TreeNode* invertTree(TreeNode* root) {
        revert(root);
        return root;
    }
};
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容