给你二叉树的根结点 root ,请你将它展开为一个单链表:
展开后的单链表应该同样使用 TreeNode ,其中 right 子指针指向链表中下一个结点,而左子指针始终为 null 。
展开后的单链表应该与二叉树 先序遍历 顺序相同。
示例 1:
输入:root = [1,2,5,3,4,null,6]
输出:[1,null,2,null,3,null,4,null,5,null,6]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [0]
输出:[0]
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/flatten-binary-tree-to-linked-list
思路:东哥带你刷二叉树(思路篇) :: labuladong的算法小抄
递归法
/**
* 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) {
if(root == nullptr) {
return;
}
TreeNode* leftNode = root->left;
TreeNode* rightNode = root->right;
flatten(root->left);
flatten(root->right);
root->left = nullptr;
root->right = leftNode;
TreeNode* p = root; // 要从 root开始遍历右节点,因为 leftNode 有可能是空指针
while(p->right!=nullptr) {
p = p->right;
}
p->right = rightNode;
}
};
简单一点的方法,直接先序遍历一次:
c++:
/**
* 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:
vector<TreeNode*> result;
void flatten(TreeNode* root) {
if(root == nullptr) {
return;
}
transverse(root);
cout<< result.size() << endl;
for(auto i=0;i < result.size()-1;i++) {
result[i]->right = result[i+1];
}
}
void transverse(TreeNode* root) {
if(root == nullptr) {
return;
}
result.push_back(root);
transverse(root->left);
transverse(root->right);
root->left = nullptr;
}
};