【小白爬Leetcode226】翻转二叉树 Invert Binary Tree

题目

Leetcode226 $medium$
点击进入原题链接：翻转二叉树 Invert Binary Tree

Given a binary tree, return the inorder traversal of its nodes’ values.

BFS 循环

/**
 * 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) return root;
        queue<TreeNode*> Q;
        Q.push(root);
        while(!Q.empty()){
            TreeNode* cur = Q.front();
            Q.pop();
            if(cur->left) Q.push(cur->left);
            if(cur->right) Q.push(cur->right);
            TreeNode* tmp = cur->left;
            cur->left = cur->right;
            cur->right = tmp;
        }
        return root;
    }
};

这里有个需要注意的地方：
就算root是nullptr，被push进队列里，队列也是不为空的！

DFS递归

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

这里有一个有意思的地方，就是
if(root==nullptr)比if(!root)更快，可能是后者需要将TreeNode* 隐式转换成 bool类型吧，下次记着用前者就好了。