114. Flatten Binary Tree to Linked List

 

题目描述:

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

For example, given the following tree:

    1
   / \
  2   5
 / \   \
3   4   6

The flattened tree should look like:

1
 \
  2
   \
    3
     \
      4
       \
        5
         \
          6

程序： 

class Solution {
public:
    void flatten(TreeNode* root) {
        if(root == NULL) return;
        else if(root->left == NULL && root->right == NULL) return;
        else if(root->left == NULL) {
            flatten(root->right);
        }
        else if(root->right == NULL) {
            flatten(root->left);
            root->right = root->left;
            root->left = NULL;
        }
        else {
            flatten(root->left);
            flatten(root->right);
            TreeNode* temp = root->left;
            while(temp->right) {
                temp = temp->right;
            }
            temp->right = root->right;
            root->right = root->left;
            root->left = NULL;
        }
    }
};