/**
* 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 doo(TreeNode* root,TreeNode* & pend)
{
if(!root) return;
TreeNode* p=root->right,*pe=root;
if(root->left)
{
doo(root->left,pe);
pe->right=root->right;
root->right=root->left;
root->left=NULL;
}
if(p)
{
doo(p,pe);
}
pend=pe;
return ;
}
void flatten(TreeNode* root) {
TreeNode* p;
doo(root,p);
return ;
}
};