备忘–剑指offer28题对称的二叉树非递归解法
牛客网试题链接:https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&&tqId=11171&rp=1&ru=/activity/oj&qru=/ta/coding-interviews/question-ranking
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if (pRoot == nullptr)
return ;
vector<TreeNode*> vt;
vt.push_back(pRoot);
int i=0;
TreeNode * p_temp;
while (i<vt.size())
{
if (vt[i]->left != nullptr || vt[i]->right !=nullptr )
{
p_temp = vt[i]->left;
vt[i]->left = vt[i]->right;
vt[i]->right = p_temp;
if (vt[i]->left != nullptr)
vt.push_back(vt[i]->left);
if (vt[i]->right != nullptr)
vt.push_back(vt[i]->right);
}
i++;
}
}
};