Flatten Binary Tree to Linked List LeetCode solution in C++

1
class Solution {
2
public:
3
TreeNode *prev = NULL;
4

5
void flatten(TreeNode *root) {
6
if (root == NULL) return;
7

8
flatten(root->right);
9
flatten(root->left);
10

11
root->right = prev;
12
root->left = NULL;
13
prev = root;
14
}
15
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0