方法一:
TreeNode* Mirror(TreeNode* pRoot)
{
if(pRoot==NULL) return NULL;
TreeNode* Left = Mirror(pRoot->left);
TreeNode* Right= Mirror(pRoot->right);
pRoot->left = right;
pRoot->right = left;
return pRoot;
}
方法二:
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* };
*/
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pRoot TreeNode类
* @return TreeNode类
*/
TreeNode* Mirror(TreeNode* pRoot) {
// write code here
if(pRoot == NULL) return NULL;
stack<TreeNode *>s;
s.push(pRoot);
while(!s.empty())
{
TreeNode* node = s.top();
s.pop();
if(node->left != NULL)
{
s.push(node->left);
}
if(node->right != NULL)
{
s.push(node->right);
}
TreeNode* temp = node->left;
node->left = node->right;
node->right = temp;
}
return pRoot;
}
};