请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例 1:
输入:root = [4,2,7,1,3,6,9] 输出:[4,7,2,9,6,3,1]限制:
0 <= 节点个数 <= 1000
方法一:递归法
代码语言:cpp
/**
* 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* mirrorTree(TreeNode* root) {
if(root == nullptr)
return root;
stack<TreeNode*> s;
s.push(root);
while(!s.empty()){
TreeNode* node = s.top();
s.pop();
if(node->left != nullptr || node->right != nullptr){
TreeNode *pnode = node->left;
node->left = node->right;
node->right = pnode;
}
if(node->left) s.push(node->left);
if(node->right) s.push(node->right);
}
return root;
}
};
68 / 68 个通过测试用例
状态:通过
执行用时: 4 ms
内存消耗: 8.8 MB
方法二:栈
代码语言:cpp
/**
* 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* mirrorTree(TreeNode* root) {
if(root == nullptr)
return root;
stack<TreeNode*> s;
s.push(root);
while(!s.empty()){
TreeNode* node = s.top();
s.pop();
if(node->left != nullptr || node->right != nullptr){
TreeNode *pnode = node->left;
node->left = node->right;
node->right = pnode;
}
if(node->left) s.push(node->left);
if(node->right) s.push(node->right);
}
return root;
}
};
68 / 68 个通过测试用例
状态:通过
执行用时: 4 ms
内存消耗: 9.1 MB