- 翻转二叉树
给你一棵二叉树的根节点 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 = []
输出:[]
提示:
树中节点数目范围在 [0, 100] 内
-100 <= Node.val <= 100
通过次数537,914提交次数677,721
法1:递归
/**
* 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:
void invertTree_Two(TreeNode *root)
{
if(root==nullptr)
{
return ;
}
struct TreeNode *p=root->left;
root->left=root->right;
root->right=p;
p=nullptr;
invertTree_Two(root->left);
invertTree_Two(root->right);
}
TreeNode* invertTree(TreeNode* root) {
invertTree_Two(root);
return root;
}
};
法2:深度优先遍历
/**
* 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*>tmp;
if(root==nullptr)
{
return nullptr;
}
tmp.push(root);
while(!tmp.empty())
{
if(tmp.top()->left!=nullptr&&tmp.top()->right!=nullptr)
{
TreeNode *p=tmp.top()->left;
tmp.top()->left=tmp.top()->right;
tmp.top()->right=p;
p=nullptr;
}
else{
if(tmp.top()->left==nullptr)
{
tmp.top()->left=tmp.top()->right;
tmp.top()->right=nullptr;
}
else
{
tmp.top()->right=tmp.top()->left;
tmp.top()->left=nullptr;
}
}
TreeNode *p= tmp.top();这里是重点 一定要定义一个变量,方便
tmp.pop();还有一个重点是清楚栈顶删除和加入左右子节点下标二者之间的顺序!
if(p->left!=nullptr){
tmp.push(p->left);}
if(p->right!=nullptr){
tmp.push(p->right);}
}
return root;
}
};
swap给我看的很爽
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if (root == NULL) return root;
stack<TreeNode*> st;
st.push(root);
while(!st.empty()) {
TreeNode* node = st.top(); // 中
st.pop();
swap(node->left, node->right);
if(node->right) st.push(node->right); // 右
if(node->left) st.push(node->left); // 左
}
return root;
}
};