首页 > 代码库 > 31. Flatten Binary Tree to Linked List
31. Flatten Binary Tree to Linked List
Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.
For example, Given
1 / 2 5 / \ 3 4 6
The flattened tree should look like:
1 2 3 4 5 6
click to show hints.
Hints:
If you notice carefully in the flattened tree, each node‘s right child points to the next node of a pre-order traversal
思想： 如 Hints.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ TreeNode* getPreNode(TreeNode *root) { if(root == NULL) return NULL; while(root->right) root = root->right; return root; }class Solution {public: void flatten(TreeNode *root) { if(root == NULL) return; TreeNode *pre = getPreNode(root->left); if(pre) { pre->right = root->right; root->right = root->left; root->left = NULL; } flatten(root->right); }};
31. Flatten Binary Tree to Linked List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。