LeetCode 114. 二叉树展开为链表
题目
给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1
/
2 5
/ \
3 4 6
将其展开为:
1
2
3
4
5
6
分析
每次将当前结点的右节点接到左节点的最右结点上,让后用左节点替换右节点。
C++代码
/**
* 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;
}
while(root->left != NULL || root->right != NULL){
if(root->left != NULL)
helper(root);
root = root->right;
}
}
void helper(TreeNode* root){
TreeNode* temp = root->left;
while(temp->right != NULL){
temp = temp->right;
}
temp->right = root->right;
root->right = root->left;
root->left = NULL;
}
};/**
* 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;
}
while(root->left != NULL || root->right != NULL){
if(root->left != NULL)
helper(root);
root = root->right;
}
}
void helper(TreeNode* root){
TreeNode* temp = root->left;
while(temp->right != NULL){
temp = temp->right;
}
temp->right = root->right;
root->right = root->left;
root->left = NULL;
}
};