题意:将树展开成链表的形式。
思路:DFS, 将右子树连接到左子树的最右叶结点上。
/**
* 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) {
dfs(root);
}
void dfs(TreeNode* root) {
if(root == NULL) return;
if(root->left == NULL && root->right == NULL) return;
if(root->left == NULL && root->right != NULL) {
dfs(root->right);
return;
}
TreeNode* tempr = root->right;
TreeNode* toLink = findR(root->left);
root->right = root->left;
root->left = NULL;
toLink ->right = tempr;
dfs(root->right);
return;
}
TreeNode* findR(TreeNode* root) {
if(root->right != NULL) return findR(root->right);
if(root->left != NULL) return findR(root->left);
return root;
}
};
此题还有非递归解法,思路是相同的。
/**
* 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) {
TreeNode* myroot = root;
while(myroot) {
if(myroot->left) {
TreeNode* tempr = myroot->left;
while(tempr->right != NULL || tempr->left != NULL) {
if(tempr->right) {
tempr = tempr->right;
continue;
}
else tempr = tempr->left;
}
tempr->right = myroot->right;
myroot->right = myroot->left;
myroot->left = NULL;
}
myroot = myroot->right;
}
}
};