114. Flatten Binary Tree to Linked List

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

For example,
Given

     1
    / \
   2   5
  / \   \
 3   4   6

The flattened tree should look like:
1
\
2
\
3
\
4
\
5
\
6
click to show hints.

Subscribe to see which companies asked this question

//按照题意从根节点开始，如果当前节点有左孩子，就将它的左孩子添加到自己和右孩子之间，这里每次需要找到左孩子最右边的节点，
//连接到当前右孩子。然后依次往右处理自己的右孩子，直到右孩子为空。
    void flatten(TreeNode* root) {
        if(NULL == root) return;

        while(root != NULL)
        {
            if(root->left != NULL)
            {
                TreeNode* left = root->left;
                while(left->right)
                    left = left->right;
                left->right = root->right;
                root->right = root->left;
                root->left = NULL;
            }

            root = root->right;
        }
    }

参考代码：http://www.2cto.com/kf/201409/331296.html