/**
* 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 *prev;
void DFS(TreeNode *root) {
if (!root) return;
prev->left = NULL;
prev->right = root;
prev = root;
TreeNode *right = root->right;
DFS(root->left);
DFS(right);
}
void flatten(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root) return;
prev = root;
TreeNode *right = root->right;
DFS(root->left);
DFS(right);
}
};
Small Case: 4ms
Large Case: 52ms
Time: O(n)
Space: O(1)
Pre-Order traverse.