[leetcode]114. Flatten Binary Tree to Linked List

[leetcode]114. Flatten Binary Tree to Linked List

---

Analysis

努力工作哇—— [每天刷题并不难0.0]

Given a binary tree, flatten it to a linked list in-place.

Explanation:

参考：http://www.cnblogs.com/grandyang/p/4293853.html，解释的很清楚

Implement

/**
 * 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* cur = root;
        while(cur){
            if(cur->left){
                TreeNode* tmp = cur->left;
                while(tmp->right)
                    tmp = tmp->right;
                tmp->right = cur->right;
                cur->right = cur->left;
                cur->left = NULL;
            }
            cur = cur->right;
        }
    }
};