递归建树,递归函数返回 以给定节点为根的子树flatten后最后一个节点。还是比较简单。
/**
* 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* _build(TreeNode *root){
if(root->left==NULL && root->right==NULL)
return root;
if(root->left==NULL)
return _build(root->right);
if(root->right==NULL){
root->right = root->left;
root->left = NULL;
return _build(root->right);
}
TreeNode *left_last = _build(root->left);
TreeNode *right_last = _build(root->right);
TreeNode *left = root->left;
TreeNode *right = root->right;
root->left = NULL;
root->right = left;
left_last->right = right;
return right_last;
}
void flatten(TreeNode *root) {
if(root==NULL)
return;
_build(root);
}
};