class Solution {
public:
void preOrder(TreeNode* root, vector<TreeNode*>& temp){
if(root == nullptr) return;
temp.push_back(root);
preOrder(root->left, temp);
preOrder(root->right, temp);
}
void flatten(TreeNode* root) {
if(root == nullptr) return;
vector<TreeNode*> temp;
preOrder(root, temp);
for(int i = 0; i < temp.size(); i++){
if(i == temp.size() - 1){
temp[i]->left = temp[i]->right = nullptr;
}else{
temp[i]->left = nullptr;
temp[i]->right = temp[i + 1];
}
}
}
};
LeetCode Hot100114.二叉树展开为链表
最新推荐文章于 2024-09-28 10:34:40 发布