题目要求前序遍历完后更新指针为linked list
问题不难,可以用iterative 按照前序遍历来遍历所有node。
然后同时更新指针就好了。
代码如下:
/**
* 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 flatten(TreeNode* root) {
//pre-order traversal
stack<TreeNode*> mystack;
TreeNode* tail;
TreeNode* head = nullptr;
if(root == nullptr)
return;
mystack.push(root);
while(!mystack.empty()) {
TreeNode* cur = mystack.top();
if(head == nullptr)
head = cur;
else
tail->right = cur;
tail = cur;
mystack.pop();
if(cur->right != nullptr)
mystack.push(cur->right);
if(cur->left != nullptr)
mystack.push(cur->left);
cur->left = nullptr; //犯了个错误,cur 的左指针应该在处理完后再更新。不然就找不到左子树了。
}
return ;
}
};