226. 翻转二叉树(二叉树)(Leetcode刷题笔记)
欢迎大家访问我的GitHub博客
https://lunan0320.cn
题目
给你一棵二叉树的根节点 root ,翻转这棵二叉树,并返回其根节点。
示例 1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
示例 2:
输入:root = [2,1,3]
输出:[2,3,1]
示例 3:
输入:root = []
输出:[]
解题代码 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) return root;
//交换当前的左右子树
swap(root->left,root->right);
//递归操作,交换
invertTree(root->left);
invertTree(root->right);
return root;
}
};
解题代码 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) {
stack<TreeNode*> st;
if(!root) return root;
st.push(root);
//栈不为空就循环
while(!st.empty()){
//取出
TreeNode* tmp = st.top();
st.pop();
//交换
swap(tmp->left,tmp->right);
if(tmp->right) st.push(tmp->right);
if(tmp->left) st.push(tmp->left);
}
return root;
}
};
解题代码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) {
queue<TreeNode*>que;
if(!root) return root;
TreeNode* ptr = root;
que.push(ptr);
while(!que.empty()){
int size = que.size();
for(int i = 0;i < size; i++){
TreeNode* tmp = que.front();
que.pop();
swap(tmp->left,tmp->right);
if(tmp->left) que.push(tmp->left);
if(tmp->right) que.push(tmp->right);
}
}
return root;
}
};
算法效率
执行用时:0 ms, 在所有 C++ 提交中击败了100.00%的用户
内存消耗:9.4 MB,在所有 C++ 提交中击败了73.71%的用户