Leetcode 114. 二叉树展开为链表
题目描述:
给你二叉树的根结点 root ,请你将它展开为一个单链表:
- 展开后的单链表应该同样使用 TreeNode ,其中 right 子指针指向链表中下一个结点,而左子指针始终为 null 。
- 展开后的单链表应该与二叉树 先序遍历 顺序相同。
解题思路:
方法1: 先对二叉树进行前序遍历,边遍历边将节点存到一个数组vector中。接下来遍历这个数组进行展开为链表的操作。(递归和迭代的方式都可以实现)
方法2:前序遍历和展开同步进行。(迭代实现)
//方法1:递归
/**
* 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 {
private:
vector<TreeNode*> l;
public:
void flatten(TreeNode* root) {
preorderTraversal(root);
for (int i = 1; i < l.size(); ++i) {
TreeNode* prev = l[i - 1], *cur = l[i];
prev->left = nullptr;
prev->right = cur;
}
}
void preorderTraversal(TreeNode* root) {
if (nullptr == root) return;
l.push_back(root);
preorderTraversal(root->left);
preorderTraversal(root->right);
}
};
//方法1:迭代
/**
* 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) {
auto v = vector<TreeNode*>();
auto stk = stack<TreeNode*>();
//前序遍历
TreeNode* node = root;
while (nullptr != node || !stk.empty()) {
while (nullptr != node) {
v.push_back(node);
stk.push(node);
node = node->left;
}
node = stk.top(), stk.pop();
node = node->right;
}
//展开为链表
for (int i = 1; i < v.size(); ++i) {
TreeNode* prev = v[i - 1], *cur = v[i];
prev->left = nullptr;
prev->right = cur;
}
}
};
//方法2:
/**
* 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) {
if (nullptr == root) return;
auto stk = stack<TreeNode*>();
stk.push(root);
TreeNode* prev = nullptr;
while (!stk.empty()) {
TreeNode* cur = stk.top();
stk.pop();
if (nullptr != prev) {
prev->left = nullptr;
prev->right = cur;
}
TreeNode* left = cur->left, *right = cur->right;
if (nullptr != right) {
stk.push(right);
}
if (nullptr != left) {
stk.push(left);
}
prev = cur;
}
}
};