题目描述
给定一个二叉树,原地将它展开为链表。
示例
例如,给定二叉树
1
/ \
2 5
/ \ \
3 4 6
将其展开为:
1
\
2
\
3
\
4
\
5
\
6
思路1
递归思想。先找到左子树得最左节点,然后返回其父节点,将其右节点断开并保存右节点副本,将其左节点放在其右子树上,其左子树置空,最后将右结点副本放到右子树最右节点后面。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void flatten(TreeNode* root) {
if (!root) return;
if (root->left) flatten(root->left);
if (root->right) flatten(root->right);
if (!root->left) return;
else {
TreeNode* tmp = root->right;
root->right = root->left;
root->left = nullptr;
while (root->right) root = root->right;
root->right = tmp;
}
}
};
思路2
迭代思想。如果根节点得左子树不为空,则先找到左子树得最右节点,将根节点得右子树放到此节点得右孩子上,然后将根节点得左子树放到右子树上,最后将根节点得左子树置空。
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void flatten(TreeNode* root) {
while (root){
while (root->left){
TreeNode* most_right = root->left;
while (most_right->right) most_right = most_right->right;
most_right->right = root->right;
root->right = root->left;
root->left = nullptr;
}
root = root->right;
}
}
};