【LeetCode】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) {
        stack<TreeNode*>tree;
        if (root == NULL)
		return;
		tree.push(root);
		while (tree.size())
		{
		    auto p = tree.top();
		tree.pop();
		if (p->right)
			tree.push(p->right);
		if (p->left)
			tree.push(p->left);

		p->left = NULL;
		if (tree.size())
		{
			p->right = tree.top();
		}
		}
    }
};