Problem Description:
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / \ 2 5 / \ \ 3 4 6
The flattened tree should look like:
1 \ 2 \ 3 \ 4 \ 5 \ 6
Hints:
非递归版本的主要思想就是循环将从根节点开始将每个节点的左子树插入到节点和右子树之间,具体代码如下:
If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.
分析:按照题目的意思,将二叉树变为按先序序列排列的极端右子树形式,因此解题思路就是将二叉树按照先序遍历先把节点保存下来,然后按照要求重建二叉树即可,实际中采用了非递归的先序遍历,将节点保存到vector中,最后将重建二叉树。具体代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void flatten(TreeNode *root) {
if(root==NULL)
return;
vector<TreeNode *> vec;
stack<TreeNode *> stk;
TreeNode *p=root;
while(p||!stk.empty())
{
while(p)
{
vec.push_back(p);
stk.push(p);
p=p->left;
}
if(!stk.empty())
{
p=stk.top();
stk.pop();
p=p->right;
}
}
root=vec[0];
for(int i=0;i<vec.size()-1;i++)
{
vec[i]->left=NULL;
vec[i]->right=vec[i+1];
}
vec[vec.size()-1]->left=NULL;
vec[vec.size()-1]->right=NULL;
}
};
在网上看到一种直接在二叉树上进行操作的解法,非常简洁,这里记录一下,首先递归版本思想是维护先序遍历的前一个结点pre,然后每次把pre的左结点置空,右结点设为当前结点。这里需要注意的一个问题就是我们要先把右子结点保存一下,以便等会可以进行递归,否则有可能当前结点的右结点会被覆盖,后面就取不到了,具体代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *pre=NULL;
void flatten(TreeNode *root) {
if(root==NULL)
return;
TreeNode *lastright=root->right;
if(pre!=NULL)
{
pre->left=NULL;
pre->right=root;
}
pre=root;
flatten(root->left);
flatten(lastright);
}
};
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void flatten(TreeNode *root) {
if(root==NULL)
return;
while (root != NULL)
{
if (root->left != NULL)
{
TreeNode *p = root->left;
while (p->right != NULL) //找到左子树最右边的一个节点
{
p = p->right;
}
p->right = root->right;
root->right = root->left;
root->left = NULL;
}
root = root->right;
}
}
};