给你一棵二叉树的根节点 root
,翻转这棵二叉树,并返回其根节点。
示例 1:
输入:root = [4,2,7,1,3,6,9] 输出:[4,7,2,9,6,3,1]
dfs方法
/**
* 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==nullptr) return nullptr; //指向空的就返回空
swap(root->right,root->left); //交换两个树杈
//递归
TreeNode* left = invertTree(root->left);
TreeNode* right = invertTree(root->right);
//最后返回整个树
return root;
return 0; }
};
用栈去循环:
/**
* 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 == nullptr) return nullptr; //没了就返回
stack<TreeNode*> stack; //建立栈
stack.push(root); //这里只添加了一个根的元素
while (!stack.empty())
{
TreeNode* node = stack.top(); //除去这个根部//这个根在上一步已经替换完了
stack.pop();
//添加左右树枝到栈里
if (node->left != nullptr) stack.push(node->left);
if (node->right != nullptr) stack.push(node->right);
//交换左右
TreeNode* tmp = node->left;
node->left = node->right;
node->right = tmp;
}
return root;
}
};
/*
栈:后进先出(类似装钢镚)
std::stack<int> myStack; //创立栈
myStack.push(10); //添加
myStack.top() //查看栈顶
myStack.pop() //除去栈顶
if (!myStack.empty()) //检查栈是否为空
队列:后进后出(往尾巴后面添加)
std::queue<int> myQueue;
myQueue.push(10); //只能往后边添加
myQueue.front() //检查队首
myQueue.pop(); //移除队首
if (!myQueue.empty()) //检查是否为空
*/