/**
* 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(!root){
return ;//?
}
flatten(root->left);
flatten(root->right);
//TreeNode*tem=root->right;
TreeNode*tem1=root->right;
root->right=root->left;
root->left=NULL;
while(root->right){root=root->right;}
root->right=tem1;
}
};