Note:
每次遇到左子树,就把左子树给接到右子树上面去,然后把原来的右子树,接到左子树的最右边,就这么一直做下去就满足条件了
代码如下:
/**
* 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) {
while(root){
auto p = root -> left;
if(p){
while(p -> right) p = p -> right;
p -> right = root -> right;
root -> right = root -> left;
root -> left = NULL;
}
root = root -> right;
}
}
};