LeetCode: Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

简单的题目选择非递归方法，结果第一遍居然写成层次遍历了

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        vector<int> vec;
        if (root == NULL) return vec;
        else {
            const int MAXSIZE = 10000;
            TreeNode* stack[MAXSIZE];
            int mark[MAXSIZE];
            int cnt = 0;
            stack[cnt] = root;
            mark[cnt] = 0;
            ++cnt;
            while (cnt != 0) {
                switch (mark[cnt-1]) {
                    case 0: 
                        vec.push_back(stack[cnt-1]->val);
                        ++(mark[cnt-1]);
                        if (stack[cnt-1]->left != NULL) {
                            stack[cnt] = stack[cnt-1]->left;
                            mark[cnt] = 0;
                            ++cnt;
                        }
                        break;
                    case 1:
                        TreeNode* ptr = stack[cnt-1];
                        --cnt;
                        if (ptr->right != NULL) {
                            stack[cnt] = ptr->right;
                            mark[cnt] = 0;
                            ++cnt;
                        }
                        break;
                }
            }
            return vec;
        }
        
    }
};