解法一:递归法
思路:按照先序遍历的顺序,逐步将左节点转移到右节点即可。参考下面二叉树的遍历顺序即可很容易理解。
/**
* 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:
void flatten(TreeNode* root) {
if(!root) 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;
}
};
解法二:迭代法
思路:按照先序 遍历的顺序逐步使节点就位。参考下图的步骤即可容易理解。
/**
* 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:
void flatten(TreeNode* root) {
TreeNode*cur=root;
while(cur)
{
if(cur->left)
{
TreeNode*tmp=cur->left;
while(tmp->right) tmp=tmp->right;
tmp->right=cur->right;
cur->right=cur->left;
cur->left=NULL;
}
cur=cur->right;
}
}
};