(leetcode)二叉树的前序遍历

/**
 * Definition for a binary tree node.
 * 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> a;
        if(root == NULL){
            return a;
        }
        TreeNode *q;
        //树为空为边界
        if(root != NULL){
            //初始化栈
            stack<TreeNode*> s;
            //根节点入栈
            s.push(root);
            //栈不为空，则出栈
            while(!s.empty()){
                q = s.top();
                s.pop();
                a.push_back(q->val);
                //入栈顺序从右至左
                if(q->right!=NULL){
                   s.push(q->right); 
                }
                if(q->left!=NULL){
                   s.push(q->left); 
                }
            }
        }
        return a;
    }
};