226. 翻转二叉树（C++题解含VS可运行源程序）

1.题解

递归

递归实现，很简单

2.力扣C++源码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (root == NULL) {
            return NULL;
        }
        TreeNode* left = invertTree(root->left);
        TreeNode* right = invertTree(root->right);
        root->left = right;
        root->right = left;
        return root;
    }
};

3.VS可运行源程序

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<algorithm>
#include<math.h>
#pragma warning(disable:4996)
using namespace std;

//递归
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (root == NULL) {
            return NULL;
        }
        TreeNode* left = invertTree(root->left);
        TreeNode* right = invertTree(root->right);
        root->left = right;
        root->right = left;
        return root;
    }
};
//递归方式创建与遍历
void CreateBiTree(TreeNode** T)//传的是根指针的指针，这样不用返回值了就
{
    int val;
    scanf("%d", &val);
    if (val == -1)//将叶子节点都设为-1，作为判断输入终止标志，#这个根节点就是NULL
        *T = NULL;//*T就是BiTree T的T或者是BiTNode* T的T
    else
    {
        *T = (TreeNode*)malloc(sizeof(TreeNode));
        if (!*T)//开辟空间失败就退出
            exit(-1);
        (*T)->val = val;
        CreateBiTree(&(*T)->left);//递归创建
        CreateBiTree(&(*T)->right);
    }
}
//层序遍历，每层以数组的形式展示
vector<vector<int>> levelOrder(TreeNode* root) {
    //自己写一遍，思路很清晰
    if (!root)return {};
    vector<int> temp;
    vector<vector<int>> res;
    queue<TreeNode*> store;
    store.push(root);
    int remaining = 1;
    int nextlevel = 0;

    while (!store.empty()) {
        TreeNode* node = store.front();
        store.pop();
        remaining--;
        temp.push_back(node->val);

        if (node->left) {
            store.push(node->left);
            nextlevel++;
        }
        if (node->right) {
            store.push(node->right);
            nextlevel++;
        }
        if (!remaining) {
            remaining = nextlevel;
            nextlevel = 0;
            res.push_back(temp);
            temp.clear();
        }
    }
    return res;
}
int main()
{
    printf("按先序遍历顺序输入二叉树（叶子节点的左右孩子节点均输入-1）：\n");
    TreeNode* T;
    CreateBiTree(&T);//地址传递，传根节点指针的地址
    Solution test;
    T = test.invertTree(T);
    vector<vector<int>> res = levelOrder(T);
    printf("翻转二叉树层序遍历结果为：\n");
    for (int i = 0; i < res.size(); i++) {
        for (int j = 0; j < res[i].size(); j++) {
            printf("%d ", res[i][j]);
        }
        printf("\n");
    }

	printf("\n");
	system("pause");
	return 0;
}