LeetCode-114 二叉树展开为链表

二叉树展开为链表

/**
 * 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* last=NULL;
        shendu(root,last);      
    }
    void shendu(TreeNode* node,TreeNode* &last)
    {
        if(node==NULL)
            return;
        if(node->left==NULL&&node->right==NULL)
        {
            last=node;
            return;     
        }        
        //先备份一下
        TreeNode* left=node->left;
        TreeNode* right=node->right;
        TreeNode* left_last=NULL;
        TreeNode* right_last=NULL;
        if(left)
        {
            shendu(left,left_last);
            node->right=left;
            node->left=NULL;
            last=left_last;        
        }
        if(right)
        {
            shendu(right,right_last);
            if(left)
                left_last->right=right;
            last=right_last;   
        }
    }
};