/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* f(TreeNode *root) {
if (!root) return NULL;
TreeNode *temp=root->right;
root->right=f(root->left);
root->left=NULL;
TreeNode *r=root;
while(r->right) {
r=r->right;
}
r->right=f(temp);
return root;
}
void flatten(TreeNode *root) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
f(root);
}
};
Flatten Binary Tree to Linked List
最新推荐文章于 2022-09-06 16:04:14 发布