/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
TreeNode* solve(TreeNode *root){
if(root==NULL)return NULL;
TreeNode *left,*right;
left=solve(root->left);
right=solve(root->right);
if(left!=NULL){
root->right=left;
root->left=NULL;
while(left->right!=NULL)left=left->right;
left->right=right;
}
return root;
}
public:
void flatten(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
solve(root);
}
};
Flatten Binary Tree to Linked List
最新推荐文章于 2022-02-22 10:11:49 发布