Flatten Binary Tree to Linked List

class Solution {
public:
    TreeNode * preorder(TreeNode *root)
    {
        if(root==NULL)
           return NULL;
        TreeNode *p=preorder(root->left),*q;
        if(p!=NULL)
        {
	   TreeNode *phead=p;
	   while(p->right!=NULL)
		p=p->right;
            p->right=root->right;
            root->right=phead;
            root->left=NULL;
            q=preorder(p->right);
        }
        else
	{
           q=preorder(root->right);
	   root->right=q;
	}
        return root;
    }
    void flatten(TreeNode *root) {
        if(root==NULL)
           return;
        preorder(root);
    }
};

写之前没考虑清楚，写完后又改得很乱