题目
给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1
/ \
2 5
/ \ \
3 4 6
将其展开为:
1
\
2
\
3
\
4
\
5
\
6
思路
- 将当前节点的左子树插入到右子树中。具体就是找到左子树中右边最深的节点。
代码
/**
* 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* node = root;
while ( node ) {
if ( node->left ) {
TreeNode* mostRight = node->left;
while ( mostRight->right )
mostRight = mostRight->right;
mostRight->right = node->right;
node->right = node->left;
node->left = nullptr;
}
node = node->right;
}
return;
}
};