class Solution {
public:
vector<TreeNode*> v;
void dfs(TreeNode* root){
if(root==NULL)
return;
v.push_back(root);
dfs(root->left);
dfs(root->right);
}
void flatten(TreeNode* root) {
if(root == NULL)
return;
dfs(root);
for(int i = 0;i < v.size()-1;i++){
v[i]->right = v[i+1];
v[i]->left = NULL;
}
}
};
二叉树展开为链表
最新推荐文章于 2023-03-15 10:51:06 发布