Flatten Binary Tree to Linked List

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode *root) 
    {
        if(!root)
            return;
        else
        {
            TreeNode* newtail=new TreeNode(-1);
            stack<TreeNode* > s;
            s.push(root);
            while(!s.empty())
            {
                TreeNode* top = s.top();
                newtail->right=top;
                s.pop();
                newtail=newtail->right;
                if(top->right)
                    s.push(top->right);
                if(top->left)
                    s.push(top->left);
                
                top->left = NULL;
                top->right = NULL;
                
            }
            
        }
    
        
    }
};