给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1
/ \
2 5
/ \ \
3 4 6
将其展开为:
1
\
2
\
3
\
4
\
5
\
6
思路1:这里暂不考虑题目要求的原地转换,可以先先序遍历二叉树保存节点,然后遍历节点,left均置为null,right连接相邻节点
/**
* 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:
vector<TreeNode*> list;
void flatten(TreeNode* root) {
if(root==NULL)
return;
TreeNode* temp_root = root;
prefirst(temp_root);
int n = list.size();
for(int i=0;i<n-1;++i){
list[i]->right = list[i+1];
list[i]->left = NULL;
}
list[n-1]->right = NULL;
list[n-1]->left = NULL;
root = list[0];
}
void prefirst(TreeNode* root){
if(root){
list.push_back(root);
prefirst(root->left);
prefirst(root->right);
}
}
};
思路2: 先利用DFS的思路找到最左子节点,然后回到其父节点,把其父节点和右子节点断开,将原左子结点连上父节点的右子节点上,然后再把原右子节点连到新右子节点的右子节点上,然后再回到上一父节点做相同操作。
/**
* 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:
vector<TreeNode*> list;
void flatten(TreeNode* root) {
if (root==NULL)
return;
if (root->left)
flatten(root->left);
if (root->right)
flatten(root->right);
TreeNode *tmp = root->right;
root->right = root->left;
root->left = NULL;
while (root->right)
root = root->right;
root->right = tmp;
}
};