Flatten Binary Tree to Linked List [LeetCode]

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.

Hints:

If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.

Solution:

     void flatten(TreeNode *root) {
         stack<TreeNode *> nodes;
         if(root == NULL)
             return;
         nodes.push(root);
         TreeNode * pre = root;
         while(nodes.size() != ){
             TreeNode * node = nodes.top();
             nodes.pop();
             if(node->right != NULL)
                 nodes.push( node->right);
             if(node->left != NULL)
                 nodes.push( node->left);
             pre->left = NULL;
             if(node != root){
                 pre->right = node;
                 pre = pre->right;
             }

         }
     }